普通插入排序算法:
void InsertSort(DataType src[], const int size)
{
if(size <= 1) {
perror("size invaid.");
return;
}
for(int i=1; i<size; i++) {
int index = i - 1;
DataType val = src[i];
while(index >= 0 && src[index] <= val) {
src[index+1] = src[index];
index--;
}
src[index+1] = val;
}
return;
}
优化插入排序算法:
void BinInsertSort(DataType src[], const int size)
{
if(size <= 1) {
perror("size is invalid.");
return;
}
for(int i=1; i<size; i++) {
int low = 0;
int high = i-1;
int mid;
DataType val = src[i];
while(low <= high) {
mid = (low + high)/2;
if(val > src[mid]) {
high = mid - 1;
} else {
low = mid + 1;
}
}
for(int j=i-1; j>=high+1; j--) {
src[j+1] = src[j];
}
src[high+1] = val;
}
return;
}
这里的优化是利用二分查找快速定位出待插入的元素最终的“位置”,尽管如此,折半插入排序与普通插入排序的算法时间复杂度均为Log(n^2).