#include<stdio.h>
#include<iostream>
#define MAXL 100
typedef int KeyType;
typedef char InfoType;
typedef struct
{
KeyType key;
InfoType data;
}RecType;
void Display(RecType R[], int n)
{
for (int i = 0; i < n; i++)
{
printf("%d", R[i].key);
}
printf("\n");
}
void BinInsertSort(RecType R[], KeyType keys[], int n)
{
int i, j, low, high, mid;
RecType temp;
for (int i = 0; i < n; i++)
{
R[i].key = keys[i];
}
printf("排序前:");
Display(R, n);
for (i = 1; i < n; i++)
{
printf("i=%d,插入%d,插入结果:", i, R[i].key);
if (R[i].key < R[i - 1].key)
{
temp = R[i];
low = 0; high = i - 1;
while (low <= high)
{
mid = (low + high) / 2;
if (temp.key < R[mid].key)
high = mid - 1;
else
low = mid + 1;
}
for (j = i - 1; j >= high + 1; j--)
R[j + 1] = R[j];
R[high + 1] = temp;
}
Display(R, n);
}
}
int main()
{
int n = 10;
RecType R[MAXL];
KeyType a[] = { 3,7,4,2,8,1,9,0,5,6 };
BinInsertSort(R,a, n);
printf("排序后:");
Display(R, n);
system("pause");
return 1;
}
排序方法2---折半插入排序
猜你喜欢
转载自blog.csdn.net/Yun_Ge/article/details/85476513
今日推荐
周排行