#include<iostream>
using namespace std;
void insertsort(int a[], int n)
{
int i,j;
int temp;
for(i=1;i<n;i++)
{
temp=a[i];
j=i-1;
while((j>=0)&&temp<a[j])
{
a[j+1]=a[j];
j--;
}
a[j+1]=temp;
}
}
int main()
{
int k;
int a[10] ={11,23,52,41,12,25,23,8,13,24};
insertsort(a,10);
for (k = 0; k < 10; k++)
{
cout << a[k] << endl;
}
return 0;
}
转载于:https://my.oschina.net/u/1446208/blog/340224