数据结构-折半插入排序

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define MAXSIZE 20
typedef int KeyType;
typedef char InfoType;

//结构体定义
typedef struct {
KeyType key;
InfoType otherinfo;
}RedType;
typedef struct {
RedType r[MAXSIZE+1];
int length;
}SqList;

//各个函数定义
void print(SqList *L);
void init(SqList *L);
void BInsertSort(SqList *L);

//初始化，随机产生待排序的数组
void init(SqList *L) {
int n,i;
printf("请输入待排序的元素个数：");
scanf("%d",&n);
srand(((int)time(0)));//设置随机种子
for(i=1; i<=n; i++) {
L->r[i].key = rand()%10+1;
}
L->length = n;
printf("随机产生的待排数组为：");
print(L);
printf("\n");
}

//输出数组元素
void print(SqList *L) {
int i;
for(i=1; i<=L->length; i++) {
printf("%d ",L->r[i].key);
}
printf("\n");
}

//进行折半插入排序
void BInsertSort(SqList *L) {
int low,mid,high,i,j;
for(i=2; i<=L->length; i++) {
L->r[0] = L->r[i];
low = 1;
high = i-1;
while(low<=high) {
mid = (low+high)/2;
if(L->r[0].key < L->r[mid].key) {
high = mid-1;
} else {
low = mid+1;
}
}
for(j=i-1; j>=high+1; --j) {
L->r[j+1] = L->r[j];
}
L->r[high+1] = L->r[0];
printf("第%d次排序的结果为：",i-1);
print(L);
}
printf("\n");

}

//主函数
int main()
{
SqList sq;
init(&sq);
BInsertSort(&sq);
printf("排序之后的数组为：");
print(&sq);
return 0;
}