#include <iostream>//建议使用#include<bits/stdc++.h>
using namespace std;
void InsertionSort(int data[],int n){
int tmp,i,j;
for( i=1;i<n;i++){
tmp = data[i];
for( j=i-1;j>=0;j--){
if(data[j]>tmp){
data[j+1]=data[j];
}else{
break;
}
}
data[j+1] = tmp;
}
}
int main(){
int data[6] = {32,18,65,48,27,9};
InsertionSort(data,6);
for(int i=0;i<6;i++)
cout<<data[i]<<endl;
return 0;
}