内部排序->插入排序->其它插入排序->折半插入排序

 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 
 4 #define EQ(a, b) ((a) == (b))
 5 #define LT(a, b) ((a) <  (b))
 6 #define LQ(a, b) ((a) <= (b))
 7 
 8 #define MAXSIZE 20
 9 typedef int KeyType;
10 typedef int InfoType;
11 typedef struct{
12     KeyType key;
13     InfoType otherinfo;
14 }RedType;
15 
16 typedef struct{
17     RedType r[MAXSIZE+1];
18     int length;
19 }SqList;
20 
21 void PrintList(SqList L){
22     int i = 0;
23     printf("len:%d; data:", L.length);
24     for(i=1; i<=L.length; i++){
25         printf("%d ", L.r[i].key);
26     }
27     printf("\n");
28     return ;
29 }
30 
31 void BInsertSort(SqList *L)
32 {
33     int i = 0, j = 0;
34     int low = 0, high = 0, m = 0;
35     for(i=2; i<=L->length; ++i){
36         L->r[0] = L->r[i];
37         low = 1;
38         high = i-1;
39         while(low<=high){
40             m = (low+high)/2;
41             if(LT(L->r[0].key, L->r[m].key)){
42                 high = m-1;
43             }else{    
44                 low = m+1;
45             }
46         }
47         for(j=i-1; j>=high+1; --j){
48             L->r[j+1] = L->r[j];
49         }
50         L->r[high+1] = L->r[0];
51     }
52 }
53 
54 
55 int  main(int argc, char *argv[])
56 {
57     if(argc < 2){
58         return -1;
59     }
60     SqList L;
61     int i = 0;
62     for(i=1; i<argc; i++){
63         if(i>MAXSIZE)
64             break;
65         L.r[i].key = atoi(argv[i]);
66     }
67     L.length = (i-1);
68 
69     BInsertSort(&L);
70     PrintList(L);
71     return 0;
72 }