插入排序

#include<iostream>
using namespace std;
void InsertSort(int a[],int n)
{
    for(int i = 1;i<n;i++)
    {
        int k = i;
        int pre = i-1;
        int cur = a[i];
        while(pre >= 0 && cur<a[pre])
        {
            a[pre+1] = a[pre]; //后移 
            pre--;
        }
        a[pre+1] = cur;
    }
 } 
 
int main()
{
    int a[10] = {2,5,9,6,4,3,5,10,7,6};
    InsertSort(a,10); 
    for(int i = 0;i<10;i++)
    {
        cout << a[i] <<" ";
     } 
}