算法导论学习 之 插入排序

#include<iostream>
#include<vector>
#include<map>
using namespace std;
void Insertion_Sort(int * a,int length)
{
int i,j,key;
for(i = 1;i < length;i ++){
key = a[i];
j = i - 1;
while(j >= 0&&a[j] > key){
a[j + 1] = a[j];
a[j] = key;
j --;
}
}
}
int main(void)
{
int a[10];
int i;
for(i = 0;i < 10;i ++)
cin >> a[i];
Insertion_Sort(a,10);

for(i = 0;i < 10;i ++)
cout << a[i] << " ";
cout << endl;
return 0;
}