折半插入排序

#include <iostream>

using namespace std;

void MergeSort(int x[],int N)
{
	for (int i=1;i<N;i++)
	{
		int temp=x[i];
		int low=0;
		int high=i-1;
		while (low<=high)
		{
			int mid=(low+high)/2;
			if (temp<=x[mid])
			{
				high=mid-1;
			}
			else
				low=mid+1;
		}
		for (int j=i-1;j>=high+1;j--)
		{
			x[j+1]=x[j];
			
		}
		x[high+1]=temp;
	}
}
int main()
{
	int A[]={1,3,7,6,5,3,12,34,3,3453,32,23};
	MergeSort(A,sizeof(A)/sizeof(*A));
	for (int i=0;i<sizeof(A)/sizeof(*A);i++)
	{
		cout<<A[i]<< " ";
	}
	return 0;
}