类似于整理扑克的过程
#include <iostream>
using namespace std;
void insertion_sort(int a[], int n){
for(int i = 1; i <= n - 1; i++){
int x = a[i];
int j = i - 1;
while(j >= 0 && a[j] > x){
a[j+1] = a[j];
j--;
}
a[j+1] = x;
}
}
int main(){
int a[5] = {3,8,2,1,9};
insertion_sort(a, 5);
for(int i = 0; i < 5; i++){
cout << a[i] << endl;
}
return 0;
}