void midSort(Elements e[],int len){
int i,j,low,high,mid;
Elements x;
for(i = 2;i <= len;++i){
x = e[i];
low = 1;
high = i - 1;
while(low <= high){
mid = (low + high) / 2;
if(x.key < e[mid].key){
high = mid - 1;}
else{
low = mid + 1;
}
}
for(j = i - 1;j >= low;--j){
e[j+1] = e[j];
}
e[low] = x;
}
}
执行结果:
折半插入排序和直接插入排序相比改善了比较次数的数量级,达到,但实际上并没有改变时间耗费,依然是