插入排序有点像扑克牌洗牌
//插入排序
#include <iostream>
#include <vector>
using namespace std;
void InsertionSort(int *a, int len)
{
//第0个人已经出去了
for (int j = 1; j<len; j++)
{
int key = a[j];//当前出去准备比较的人
int i = j - 1;
while (i >= 0 && a[i]>key)//跟他的前一个人开始比,如果小,就再和更前面一个人开始比
{ //直到自己成为最前面的那个人(循环一定会结束)
a[i + 1] = a[i];
i--;
}
a[i + 1] = key; //插入
}
}
int main()
{
int vals[] = {9,7,6,8,5,3,4,0,1};
cout << "before sorting:" << endl;
for (int i = 0; i < 9; ++i)
{
cout << vals[i] << " ";
}
cout << endl;
InsertionSort(vals, 9);
cout << "after sorting:" << endl;
for (int i = 0; i < 9; ++i)
{
cout << vals[i] << " ";
}
cout << endl;
system("pause");
return 0;
}