1101

//采用二分法比较数字大小


#include <stdio.h>
#include <string.h>


void dichotomy_compare( int array[] , int n);
int main()
{
int array[10];
int i = 0;//i为循环变量
printf("please input 10 number:\n");
for ( i = 0 ; i < 10 ; i++ )
{
scanf("%d",&array[i]);
}//用户输入n个数字赋给数组
    
    dichotomy_compare(array,10);
    return 0;
}


void dichotomy_compare(int array[],int n)
{
int right,left,num;
int middle,i,j;//left为min,right为max(仅在当前循环中)


for ( i = 1 ; i < n ; i++ )
{
left = 0;
right = i - 1;
num = array[i];


/*二分法查找位置*/
while(right >= left)
{
middle = (left + right)/2;
if(num < array[middle])
{
right = middle - 1;
}
else
{
left = middle + 1;
}
}
for(j = i - 1;j >= left; j--)
{
array[j+1] = array[j];
}
array[left] = num;
}
printf("The result is :\n");
for ( i = 0 ; i < 10 ; i++)
{
printf("%3d",array[i]);
}//顺序输出
printf("\n");
}