C++实现折半插入排序

# include<iostream>
# include<cstdio>
using namespace std;
void BinaryInsertSort(int *_piArr,int len)
{
    int i = 1,j = 0;
    int low = 0;
    int high = 0;
    int middle = 0;
    for(;i < len;i++)
    {
        if(_piArr[i] >= _piArr[i-1])
        {
            continue;
        }
        low = 0;
        high = i-1;
        j = i;
        int x = _piArr[i];
        while(low <= high)
        {
            middle = (low+high)/2;
            if(x < _piArr[middle])
            {
                high = middle -1;
            }else if(x > _piArr[middle]){
                low = middle + 1;

            }else{
                break;
            }
        }
        while(j > low){
            _piArr[j] = _piArr[j-1];
            j--;
        }
        _piArr[low] = x;
    }
}
int main()
{
        int a[100];
        int n;
        cin>>n;
        for(int i = 0;i < n;i++)
        {
            cin>>a[i];
        }
        BinaryInsertSort(a,n);
        for(int i = 0; i < n;i++)
        {
            cout<<a[i]<<" ";
        }
}