插入排序（折半插入排序）

折半插入排序

#include<iostream>
#include <cstdlib>

using namespace std;

void BInsertSort(int *a, int l)
{
    for (int i = 1;i < l; ++i)
    {
        int tmp = a[i];
        int low = 0,high = i-1;
        while(low<=high)
        {
            int m = (low+high+1)/2;
            if(tmp < a[m])
            {
                high = m-1;
            }
            else
            {
                low = m + 1;
            }
        }

        /*移动元素*/
        for(int j = i-1;j>high;j--)
        { 
            a[j+1] = a[j];
        }

        a[high+1] = tmp;
    }
}

int main(int argc, char const *argv[])
{
    int a[] = {38,65,97,76,13,27,49};
    int l = sizeof(a)/sizeof(a[1]);

    BInsertSort(a,l);
    for (int i = 0; i < l; ++i)
    {
        cout<<a[i]<<" ";
    }
    return 0;
}