Description
用函数实现折半插入排序,并输出每趟排序的结果.
输入格式
第一行:键盘输入待排序关键的个数n
第二行:输入n个待排序关键字,用空格分隔数据
输出格式
每行输出一趟排序结果,数据之间用一个空格分隔
输入样例
10
5 4 8 0 9 3 2 6 7 1
输出样例
4 5 8 0 9 3 2 6 7 1
4 5 8 0 9 3 2 6 7 1
0 4 5 8 9 3 2 6 7 1
0 4 5 8 9 3 2 6 7 1
0 3 4 5 8 9 2 6 7 1
0 2 3 4 5 8 9 6 7 1
0 2 3 4 5 6 8 9 7 1
0 2 3 4 5 6 7 8 9 1
0 1 2 3 4 5 6 7 8 9
代码:
#include <cstdio>
#include <iostream>
using namespace std;
void binarySort(int num[], int n)
{
int i, j;
for (i = 2; i <= n; i++)
{
if (num[i-1] > num[i])
{
num[0] = num[i];
int low = 1, high = i-1, mid;
while (low <= high)
{
mid = low + ((high-low)>>1);
if (num[mid] > num[0])
high = mid-1;
else
low = low + 1;
}
for (j = i-1; j >= high + 1; j--)
num[j+1] = num[j];
num[high + 1] = num[0];
}
for (j = 1; j <= n; j++)
cout<<num[j]<<' ';
cout<<endl;
}
}
int main()
{
int n, num[1000] = {0};
cin>>n;
for (int i = 1; i <= n; i++)
cin>>num[i];
binarySort(num,n);
return 0;
}