#include<stdlib.h>
#include<stdio.h>
/*
折半插入排序是稳定的排序
查找的时间复杂度可以达到O(log n)
平均时间复杂度为O(n²)
特点:只适用于顺序存储的情况
*/
//折半插入排序(耿国华) 书上完整版
void BinSort(int r[], int length) {
int x, low, high, mid;
for (int i = 2;i <= length;++i) {
x = r[i];
low = 1;high = i - 1; //注意区别 low是从下标1开始
while (low <= high)
{
mid = (low + high) / 2;
if (x < r[mid])
high = mid - 1;
else
low = mid + 1;
}
for (int j = i - 1;j >= low;--j)
r[j + 1] = r[j];
r[low] = x;
}
}
//折半插入排序(耿国华) 自己修改版 从第一个元素到最后一个元素都进行排序
void BinSort(int r[],int length) {
int x,low,high,mid;
for (int i = 2;i <= length;i++) {
x = r[i];
low = 0;high = i - 1;
while (low<=high)
{
mid = (low + high) / 2;
if (x < r[mid])
high = mid - 1;
else
low = mid + 1;
}
for (int j = i - 1;j >= low;j--)
r[j + 1] = r[j];
r[low] = x;
}
}
void main() {
int A[6] = { 8,6,102,3,2,11 };
BinSort(A, 5);
for (int i = 0;i < 6;i++) {
printf("%d\n", A[i]);
}
system("pause");
}
插入排序——折半插入排序
最新推荐文章于 2022-08-14 01:00:00 发布