排序

1.直接插入排序:

基本操作是将一个记录插入到已排好序的有序表中,从而得到一个新的,记录数增1的有序表.

#include <stdio.h>#define MAXLENGTH7typedef struct SortTestType{ int date; int type;}SortTestType;void simpleInsertSort(SortTestType num[],int length);void printfNum(SortTestType num[],int length);int main(void){ SortTestType num[MAXLENGTH] = { {3,0}, {3,1}, {10,0}, {7,0}, {9,0}, {5,0}, {1,0} }; printf("before sort:/n"); printfNum(num,MAXLENGTH); simpleInsertSort(num,MAXLENGTH); printf("after simpleInsertSort:/n"); printfNum(num,MAXLENGTH); return 0;}void simpleInsertSort(SortTestType num[],int length){ int i,j; for(i=1;i<length;i++) {SortTestType tmpNum = num[i]; for(j=i;j>0 && tmpNum.date<num[j-1].date;j--){ num[j] = num[j-1];}num[j] = tmpNum; } return;}void printfNum(SortTestType num[],int length){ int i; for(i=0;i<length;i++) {printf("%d(%d) ",num[i].date,num[i].type); } printf("/n"); return;} 

- - - - - - - - - -out- - - - - - - - - - 

before sort:

3(0) 3(1) 10(0) 7(0) 9(0) 5(0) 1(0) 

after simpleInsertSort:

1(0) 3(0) 3(1) 5(0) 7(0) 9(0) 10(0) 

 

2.快速排序:

快速排序时冒泡排序的一种改进,他的基本思想是,通过一次排序将待排记录分割成独立的两部分,其中一部分的记录的值均比另一部分记录的值小,则可分别对着两部分记录继续排序,以达到整个序列有序.

#include <stdio.h>#define MAXLENGTH7typedef struct SortTestType{ int date; int type;}SortTestType;int execOneSort(SortTestType num[],int low,int high);void quickSort(SortTestType num[],int low,int high);void printfNum(SortTestType num[],int length);int main(void){ SortTestType num[MAXLENGTH] = { {3,0}, {3,1}, {10,0}, {7,0}, {9,0}, {5,0}, {1,0} }; printf("before sort:/n"); printfNum(num,MAXLENGTH); quickSort(num,0,MAXLENGTH-1); printf("after quickSort:/n"); printfNum(num,MAXLENGTH); return 0;}int execOneSort(SortTestType num[],int low,int high){ SortTestType tmpNum = num[low]; while(low < high) {while(low < high && tmpNum.date <= num[high].date) high --;num[low] = num[high];while(low < high && tmpNum.date >= num[low].date) low ++;num[high] = num[low]; } num[low] = tmpNum; return low;}void quickSort(SortTestType num[],int low,int high){ if(low < high) {int tmpPos = execOneSort(num,low,high);quickSort(num,low,tmpPos-1);quickSort(num,tmpPos+1,high); } return;}void printfNum(SortTestType num[],int length){ int i; for(i=0;i<length;i++) {printf("%d(%d) ",num[i].date,num[i].type); } printf("/n"); return;} 

- - - - - - - - - -out- - - - - - - - - - 

before sort:

3(0) 3(1) 10(0) 7(0) 9(0) 5(0) 1(0) 

after quickSort:

1(0) 3(1) 3(0) 5(0) 7(0) 9(0) 10(0)