czkdcs的专栏

//-------堆排序---------// void HeapAdjust(int *a, int i, int Length) { int Child; int Temp; for (Temp = a[i]; 2 * i + 1 < Length; i = Child) { Child = 2 * i + 1; if (Child < Leng...

//--------希尔排序--------- int part_sort(int *a, int lenght, int k) { int i = 0, j, c; int temp; while(i++ < k) { for(j = i; j < lenght; j = j + k) { for(c = j ; c >= i; c=...