summersunrain的博客

 //kruskal#include<iostream>#include<stdlib.h>#include<malloc.h>using namespace std;#define TOPMAX 60000#define MAX 100//邻接矩阵typedef struct _graph{ char vexs[MAX];...

//归并排序#include<iostream>using namespace std;void merge(int a[], int left, int mid, int right, int* temp){ int i = left; int j = mid + 1; int t = 0; while (i <= mid && j <=...

#include<iostream>#include<algorithm>using namespace std;void HeapAdjust(int *a, int i, int size){ int lchild = 2 * i; int rchild = 2 * i + 1; int max = i; if (i <= size / 2)...

//快速排序/*#include<iostream>using namespace std;int Partion(int a[], int low, int high){ a[0] = a[low]; int pivotkey = a[0]; while (low < high) { while (low < high && a[...

//希尔排序/*#include<iostream>using namespace std;int main(){ int a[10], i, j, temp, gap; gap = 10 / 2; for (i = 0; i < 10; i++) cin >> a[i]; while (gap >= 1) { for(i = ...

#include<iostream>using namespace std;#define SIZE 100typedef struct{ int data; int next;}SLNode;typedef struct{ SLNode r[SIZE]; int length;}SLinkListType;void Build(SLinkListTyp...