c语言几种排序方法程序.doc

下面是几种排序方法的程序： 1.交换排序 #include stdio.h #include stdlib.h int main(void) { int a[10] = {1,4,3,0,7,5,2,8,9,6}; int i = 0, j = 0; int temp = 0; for(i = 0; i 9; i++) { for(j = i+1; j10; j++) { if(a[i]a[j]) { temp = a[i]; a[i] = a[j]; a[j] = temp; } } } for(i = 0; i10; i++) { printf(%d\t, a[i]); if((i+1)%5 == 0) printf(\n); } // printf(\n); return 0; } 插入排序 #include stdio.h #include stdlib.h int main(void) { int a[9] = {5,8,3,9,2,0,4,7,10}; int temp = 0, i = 0, j = 0, z=0; for(i=0; i9; i++) { for(j=i+1; j9; j++) { if(a[j] a[i]) { temp = a[j]; for(z = j-1; z = i; z--) { a[z+1] = a[z]; } a[i] = temp; } } } for(i = 0; i9; i++) { printf(%d\t, a[i]); if((i+1)%5 == 0) printf(\n); } printf(\n); return 0; } 归并 #include stdio.h #include stdlib.h int merge(int *a, int begin, int end) { int *c = NULL; int i = 0; int x = 0, y = 0; int mid = 0; mid = (begin+end)/2; x = begin; y = mid+1; c = (int *)malloc((end+1)*4); if(c == NULL) return 0; for(i = begin; i(end+1); i++) { if(x != (mid+1) y != (end+1)) { if(a[x] a[y]) { c[i] = a[x]; x++; } else { c[i] = a[y]; y++; } } else if(x != (mid+1)) { c[i] = a[x]; x++; } else { c[i] = a[y]; y++; } } for(i = begin; iend+1; i++) { a[i] = c[i]; } free(c); return 0; } int sort(int *a, int begin, int end) { if(begin = end) return 0; int mid = 0; mid = (begin+end)/2; sort(a, begin, mid); sort(a, mid+1, end); merge(a, begin, end); return 0; } int main(void) { int i = 0; int a[10] = {1,5,2,7,4,9,10,3,0,6}; sort(a,0,9); for(i = 0; i10; i++) { printf(%d\t,a[i]); if((i+1)%5 == 0) printf(\n); } return 0; } 冒泡排序 #include stdio.h #include stdlib.h #define size 9 int main(void) { int a[size] = {3, 2, 6, 5, 4, 9, 8, 0, 7}; int i = 0, j = 0, flag = 0, temp = 0; for(i = 0; isize; i++) { for(j = 0; j (si