折半插入排序法

#include<iostream>
using namespace std;
int main()
{
	int i,j,t,low=0,high,mid;
	int a[10]={0,5,4,3,2,7,6,9,8,0};
	for(i=1;i<10;i++)
	{
		t=a[i];
		low=0;
		high=i-1;
		while(low<=high)
		{
			mid=(low+high)/2;
			if(t<a[mid])
				high=mid-1;
			else
				low=mid+1;
		}
		for(j=i-1;j>=high+1;j--)
			a[j+1]=a[j];
			a[high+1]=t;
	}
	for(i=0;i<10;i++)
	{
		cout<<a[i]<<"  ";
	}
	system("pause");
	return 0;
}