折半插入排序

1、先找出要插入点的位置

2、在移动位置

#include <iostream>
using namespace std;
void BInsertSort(int *arr,int length)
{
    for (int i = 1; i <= length - 1;i++) {//从第一个元素开始插入
        int low = 0; int high = i-1; int key = arr[i];
        if (arr[i]<arr[i-1]) {//如果arr[i]<arr[i-1]，则寻找要插入的位置
            while (low <= high) {
                int mid = (low + high) / 2;
                if (arr[mid]>key) {
                    high = mid - 1;
                }
                else {
                    low = low + 1;
                }
            }
        }
        //移位
        for (int j = i-1; j >=low;j--) {
            arr[j+1] = arr[j];
        }
        arr[low] = key;//也可以为arr[high+1]=key
    }
}
int main()
{
    int arr[10] = {9,2,1,4,5,3,7,6,8,0};
    BInsertSort(arr,10);
    for (int i = 0; i < 10;i++) {
        cout << arr[i] << " ";
    }
    return 0;
}