算法导论学习日记（1）--插入排序

#include <iostream>

int* Insertionsort(int *a,int n)
{
    int* k;
    int j=2,key=0,i=0;
    for(j=2;j<n;j++)
    {
        key=a[j];
        i=j-1;
        while(i>0&&a[i]>key)
        {
            a[i+1]=a[i];
            i=i-1;
        }
        a[i+1]=key;
    }
    return k=a;
}



    int main()
    {
        int m[]={2,25,456,8978,25,14,5};
        int i=6;
        int *a=Insertionsort(m,7);
        while(i>=0)
        {
            std::cout<<a[i]<<std::endl;
            i--;
        }

    }