Insertionsort

//Insertionsort
//Created by JamseQi
//2015.4.27
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <map>
using namespace std;
int ans[100];
void Insertionsort(int a[],int n)
{
	for (int j=2;j<=n;j++)
	{
		int i=j-1;
		int key=a[j];
		while(i>=1 && a[i]>key)//上升排序
		{
			a[i+1]=a[i];
			i--;
		}
		a[i+1]=key;
	}
}
int main()
{
	int n;
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
		scanf("%d",&ans[i]);
	Insertionsort(ans,n);
	for (int i=1;i<n;i++)
		printf("%d<",ans[i]);
	printf("%d\n",ans[n]);
	return 0;
}