输入:乱序数组
输出:顺序数组
#include <stdio.h>
void Binsert(int a[],int n)
{
int i,j,left,right,mid,x;
for (i=1; i<n; i++) {
x=a[i];
left=0;right=i-1;
while(left<=right)
{
mid=(left+right)/2;
if (x>a[mid]) {
left=mid+1;
}
else right=mid-1;
}
for (j=i-1; j>=left; j--) {
a[j+1]=a[j];
}
a[j+1]=x;
}
}
int main()
{
int a[8]={8,4,5,7,2,9,4,1},i;
for (i=0; i<8; i++) {
printf("%d ",a[i]);
}
printf("\n");
Binsert(a, 8);
for (i=0; i<8; i++) {
printf("%d ",a[i]);
}
printf("\n");
return 0;
}