插入排序

原理很简单，直接看代码：

#include<iostream>
#include<cstdio> 
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
const int maxn = 100 + 10;
int a[maxn];
int n;
void solve()
{
	for(int i = 1; i <= n; i ++)
	{
		int x = a[i];
		int j = i - 1;
		while(j >= 1 && a[j] > x)
		{
			a[j + 1] = a[j];
			j --;
		}
		a[j + 1] = x;
	}
}
int main()
{
	while( ~ scanf("%d",&n))
	{
		for(int i = 1; i <= n; i ++)
		{
			scanf("%d",&a[i]);
		}
		solve();
		for(int i = 1; i <= n; i ++)
		cout << a[i] << " ";
		cout <<endl; 
	}
	return 0;
}