各种排序算法(国外英语资料).doc

各种排序算法(国外英语资料) The various internal sorting sorting methods: bubble sort, quick sort, simple selection sort, binary insertion sort, Hill sort, heap sort, merge sort (non recursive algorithm), radix sort (1) bubble sort #includestdio.h #includemalloc.h #define OK 1 #define ERROR 0 #define LIST_INIT_SIZE 100 #define LISTINCREMENT 10 #define ElemType int Typedef struct { Int *elem; Int length; Int listsize; }SqList; Int InitList_Sq (SqList L) { L.elem= (ElemType*) malloc (LIST_INIT_SIZE*sizeof (ElemType)); If (... L.elem) return ERROR; L.length=0; L.listsize=LIST_INIT_SIZE; Return OK; } Int Load_Sq (SqList L) { Int i; If (L.length==0) printf (The, List, is, empty, \n); Else { Printf (The List / / is:); For (i=0; iL.length; i++) Printf (%d, L.elem[i]); Printf (\n); } Return OK; } Int, main () { SqList L; Int, I, J, t, f=0; InitList_Sq (L); Scanf (%d, L.length); For (i=0; iL.length; i++) { Scanf (%d, L.elem[i]); } For (i=L.length-1; i=0; i--) { For (j=0; ji; j++) { If (L.elem[j]L.elem[j+1]) { T=L.elem[j]; L.elem[j]=L.elem[j+1]; L.elem[j+1]=t; F=1; } } If (f==1) {Load_Sq (L); f=0;} } Load_Sq (L); } (2) quick sort #includestdio.h #includemalloc.h #define OK 1 #define ERROR 0 #define LIST_INIT_SIZE 100 #define LISTINCREMENT 10 #define ElemType int Typedef struct { Int *elem; Int length; Int listsize; }SqList; Int InitList_Sq (SqList L) { L.elem= (ElemType*) malloc (LIST_INIT_SIZE*sizeof (ElemType)); If (... L.elem) return ERROR; L.length=0; L.listsize=LIST_INIT_SIZE; Return OK; } Int Load_Sq (SqList L) { Int i; If (L.length==0) printf (The, List, is, empty, \n); Else { Printf (The List / / is:); For (i=1; i=L.length; i++) Printf (%d, L.elem[i]); Printf (\n); } Return OK; } Int Partition (SqList, L, int, low, int, high) { Int key; L.elem[0]=L.elem[low]; Key=L.elem[low]; While (lowhigh) { While (lowhighL.elem[high]=key) --high; L.elem[low]=L.elem[high]; While (lowhighL.elem[low]=key) ++low; L.elem[high]=L.elem[low]; } L.elem[low]=L.elem[0]; Load_Sq (L); Return low; } Void QSo