直接插入排序、二分（折半）插入排序

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<iostream>
using namespace std;
#define MAXSIZE 1000
#define OK 0
typedef int KeyType;
typedef int Status;
typedef struct{
    KeyType key;
}RedType;
typedef struct {
    RedType *r;
    int length;
}SqList;
Status InitSqList(SqList &L){//构造一个空的顺序表
    L.r=new RedType[MAXSIZE+1];
    L.length=0;
    return OK;
}
Status Getr(SqList L,int n){//取值
    int i;
    //cout<<"请输入数字"<<endl;
    srand(time(0));
    cout<<"随机生成数字："<<endl;
    for(i=1;i<=n;i++)
       // cin>>L.r[i].key;
       L.r[i].key=rand();
    for(i=1;i<=n;i++)
       cout<<L.r[i].key<<endl;

}
void InsertSort(SqList &L){//直接插入排序
    int i,j;
    for(i=2;i<=L.length;i++)
        if(L.r[i].key<L.r[i-1].key){
            L.r[0]=L.r[i];
            L.r[i]=L.r[i-1];
            for(j=i-2;L.r[0].key<L.r[j].key;j--)
                L.r[j+1]=L.r[j];
            L.r[j+1]=L.r[0];
        }
}
void BInsertSort(SqList &L){//折半插入排序
    int i,j,low,high,m;
    for(i=2;i<=L.length;i++){
        L.r[0]=L.r[i];
        low=1;high=i-1;
        while(low<=high){
            m=(low+high)/2;
            if(L.r[0].key<L.r[m].key)
                high=m-1;
            else low=m+1;
        }
        for(j=i-1;j>=high+1;j--){
            L.r[j+1]=L.r[j];
        }
        L.r[high+1]=L.r[0];
    }
}

Status PrintSqList(SqList L){//输出排序结果
    int i;
    cout<<"排序后的结果为："<<endl;
    for(i=1;i<=L.length;i++){
        cout<<L.r[i].key<<endl;
    }
}

int main(){
    time_t t_start,t_end;
    t_start=time(NULL);
    system("pause");
    SqList L;
    InitSqList(L);
    int n,c;
    cout<<"请输入(随机生成)数字个数:"<<endl;
    cin>>n;
    Getr(L,n);
    L.length=n;
    cout<<"请选择：1.直接插入排序 2.折半插入排序"<<endl;
    cin>>c;
    switch(c){
    case(1):
        InsertSort(L);
        PrintSqList(L);
        break;
    case(2):
        BInsertSort(L);
        PrintSqList(L);
        break;
    }
    t_end=time(NULL);
    cout<<"The pause used "<<difftime(t_end,t_start)<<"s by clock()"<<endl;
    system("pause");
return 0;
}