标签:style blog os 2014 for 代码 div ar
直接上代码:
//二分插入排序 void binary_insert_sort(int arr[],int len) { if(arr == NULL || len <= 1) { return; } int i,j; for(i = 1; i < len; i++) { int low = 0,high = i-1; int target = arr[i]; while(low <= high) { int middle = low + ((high - low)>>1); if(arr[middle] > target) { high = middle-1; }else { low = middle+1; } } //low的位置正好是插入点 //i与low之间的元素后移一位(不包括i) for(j = i; j>low; j--) { arr[j] = arr[j-1]; } //将target插入到正确位置 arr[low] = target; } }
标签:style blog os 2014 for 代码 div ar
原文地址:http://blog.csdn.net/chdjj/article/details/38169015