折半插入排序

void InsertSort(int A[], int n) {
	int i, j, low, high, mid;
	
	for (i = 2; i <= n; i ++) {
		A[0] = A[i];	//要进行插入的值 
		low = 1, high = i - 1;	
		while (low <= high) {
			mid = (low + high)/2;		//折半 
			if (A[mid].key > A[0].key) {	//因为0-(i-1)都是有序的，所以mid > 0的话，那么mid后面的值也都大于A[0]的值 
				high = mid - 1;
			}
			else
				low = mid + 1;		//同理 
		}
		
		for (j = i - 1; j >= mid + 1; j --) {
			A[j + 1] = A[j];	//大值后移 
		}
	
		A[high + 1] = A[0];		//存放插入的值 
	}
	
	
}