walterby的专栏

1 /*      2     mergesort      3 */      4       5 #include      6 #include      7 /*  Lpos = start of left half, Rpos = start of right half   */      8 //void Merge(ElementType A[]. Ele

1 /* 2 insertion sort 3 */ 4 5 #include 6 7 void InsertionSort(int A[], int N) 8 { 9 int j, p; 10 //ElementType Tmp; 11 int

python/C

1 /* quicksort */ 2 #include 3 4 #define Cutoff (3) 5 6 InsertionSort(int A[], int n) 7 { 8 int tmp, i, j; 9 10 for(i = 1; i < n; i++

1 /* 2 Shellsort route using Shell's increments 3 4 */ 5 6 7 #include 8 9 void Shellsort(int A[], unsigned int N) 10 { 11 in

1 /* 2 heapsort 3 */ 4 5 #include 6 #define LeftChild(i)(2 * (i) + 1) 7 8 //void PercDown(ElementType A[], int i, int N) 9 void PercDown(int A[],

1 #include 2 int gcd(int a, int b) 3 { 4 if (b == 0) 5 return a; 6 return gcd(b, a % b); 7 } 8 9 int main(void) 10 { 11 int