插入排序法

#include<iostream.h>
void paixu(int *s,int n);
void main()
{
int array[]={55,2,6,4,32,12,9,73,26,37};
for(int i=0;i<10;i++)
cout<<array[i]<<" ";
cout<<endl;
paixu(array,10);
for( i=0;i<10;i++)
cout<<array[i]<<" ";
cout<<endl;
}
void paixu(int *s,int n)
{
int insert,index;
for(int i=1;i<n;i++)
{
insert=s[i];
index=i-1;
while(index>=0&&insert<s[index])
{
s[index+1]=s[index];
index--;
}
s[index+1]=insert;
}
}