算法导论之插入排序C++实现

伪代码：

INSERTION-SORT(A)

1 for j=2 to A.lenght

2 key=A[i]

3 i=j-1

4 while i >0 and A[i]>key

5 A[i+1]=A[i]

6 i=i-1;

7 A[i]=key

C++ 代码实现

void insertion_sort(int a[],int len)
{
   int j=1;
   for(;j<len;j++)
   {
        int key=a[j];
        int i=j-1;
   while(i>0&&key<a[i])
   {
       a[i+1]=a[i];
       i--;
   }
   a[i+1]=key;
   }
}