用二分法實(shí)現(xiàn)排序

#include<stdio.h>int main(){	int i,array[100],n,j;	PRintf("Please enter the number quantities:/n");	scanf("%d",&n);	printf("Please input some numbers:/n");	for(i = 0; i < n; i++)	{		scanf("%d",&array[i]);	}	for ( i = 0; i < n; i++)  	{  		int start = 0;  		int end = i - 1;  		int middle = 0;  		int temp = array[i];  		while (start <= end)                  //左邊大于右邊結(jié)束		{   			middle = (start + end) / 2;   //取中間元素			if (array[middle] > temp)//要排序元素在已經(jīng)排過(guò)序的數(shù)組左邊  			{  				end = middle - 1;  			}  			else  			{  				start = middle + 1;  			}  		}  		for ( j = i - 1; j > end; j--)//找到了插入的位置，然后將這個(gè)位置以后的所有元素向后移動(dòng)  		{  			array[j + 1] = array[j];  		}  		array[end + 1] = temp;  	}  	for(i = 0; i < n; i++)	{		printf("%d ",array[i]);	}}