//CIS  610: Sorting
//Syed Rais Ahmad
//Due Nov 11,99
//Sorting by counting.

#include<iostream.h>
#define SIZE 10

main()
{
	void counting(int *);
	int arr[]={11,3,11,11,1,2,6,3,9,4};
	counting(arr);
	return 0;
}


void counting(int * x)
{
	int count[SIZE][2];
	int i=0,j=0,k=0;
	for (i=0;i<SIZE;i++) count[i][1]=0;
	
	for(i=0;i<SIZE;i++) 
	{
		k=0;
		for(j=0;j<SIZE;j++)  
			if (x[j]<=x[i]) k++;
			
		count[k-1][1]+=1;
		count[k-1][0]=x[i];
	}
	for(i=SIZE-1;i>-1;i--) if (count[i][1]>1) { for(j=count[i][1];j>0;j--) count[i-j+1][0]=count[i][0];}
	for(i=0;i<SIZE;i++) cout << '\n' << count[i][0] ;


}