#include <iostream>
using namespace std;
void insert_sort(int *unsorted,int len)
{
int i,j;
for(i=1;i<len;i++)
{
int tmp=unsorted[i];
for(j=i-1;j>=0 && unsorted[j]>tmp;j--)
{
unsorted[j+1]=unsorted[j];
}
unsorted[j+1]=tmp;
}
}
int main()
{
int array[]={36,15,24,63,42,21},i;
int size=sizeof(array)/sizeof(array[0]);
cout<<"排序前:";
for(i=0;i<size;i++)
cout<<array[i]<<" ";
cout<<endl;
insert_sort(array,size);
cout<<"排序后:";
for(i=0;i<size;i++)
cout<<array[i]<<" ";
cout<<endl;
return 0;
}