插入排序

#include<iostream>
using namespace std;
int a[1000];
void insertsort(int r[],int n)
{
	for(int i = 2; i <= n; i ++)
	{
	     if(a[i]<a[i-1]) 
		 {
		 	 int j;
		 	 a[0] = a[i];
             for(j = i-1; a[j] > a[0]; j--) a[j+1] = a[j];
             a[j+1] = a[0];
		 }
	     
	}
}
int main()
{
	int n;
	while(cin>>n)
	{
		for(int i = 1; i <= n;i ++)
				cin>>a[i];
		insertsort(a,n);
		for(int i =1; i <= n;i ++)
		      cout<<a[i]<<" ";
        cout<<endl;
	}
	return 0;
	
}