插入排序算法基本思想:排序好数组A[1...j-1]后,选择适当的位置插入A[j],从而排序好数组A[1..j]。使用了增量方法
#include <iostream>
using namespace std;
void InsertSort (int A[],int n)
{ int i=0,j=0;
int swapKey;
for (j=1;j<n;j++)
{
swapKey=A[j];
i=j-1;
while (i>=0 && A[i]<swapKey)
{A[i+1]=A[i];
i--;}
A[i+1]=swapKey;//if A[i]>swapKey then insert swapKey as A[i+1].Or i<0.
}
}
int main()
{ int a[]={100,87,65,24,90,80};
int len=sizeof a/sizeof(a[0]);
InsertSort(a,len);
for (int i=0;i<len;i++)
cout<<a[i]<<" ";
return 0;
}