以下以c++代码实现了插入排序算法
#include <iostream>
using namespace std;
int main()
{
int A[] = {3, 5, 9, 4, 1, 10, 2, 6, 13, 8, 15, 12};
int i, j, key;
int length = sizeof(A) / sizeof(int);
for(i = 1; i < length; i++)
{
key = A[i];
j = i - 1;
while(j > -1 && A[j] > key)
{
A[j+1] = A[j];
j--;
}
A[j+1] = key;
}
for(i = 0; i < length; i++)
cout << A[i]<<endl;
system("pause");
return 0;
}