折半插入排序（Binary Insertion Sort）的C语言实现

 1 #include <stdio.h>
 2 #define LEN 6
 3 
 4 typedef float keyType;
 5 
 6 typedef struct{
 7     keyType score;
 8     char name[20];
 9 }student;
10 
11 typedef struct{
12     int length=LEN;
13     student stu[LEN];
14 }sqList;
15 
16 void BinaryIS(sqList &L){
17     int low,mid,high;
18     for(int i=2;i<L.length;i++){
19         L.stu[0]=L.stu[i];
20         low=1,high=i-1;
21         while(low<=high){
22             mid=(low+high)/2;
23             if(L.stu[0].score>L.stu[mid].score)
24                 high=mid-1;
25             else
26                 low=mid+1;
27         }
28         L.stu[high+1]=L.stu[0];
29     }    
30 }
31 
32 int main(){
33     sqList L;
34 
35     for(int i=1;i<L.length;i++){
36         printf("\n请输入第%d个学生的姓名:",i);
37         gets(L.stu[i].name);
38         printf("分数:");
39         scanf("%f",&(L.stu[i].score));
40         getchar();
41     }    
42     
43     BinaryIS(L);
44     
45     for(int i=1;i<L.length;i++){
46         printf("\n学生%s 分数%f 第%d名",L.stu[i].name,L.stu[i].score,i);
47     }
48     return 1;
49 }