// insert sort

#include <iostream>

const int n=5;
int main()
{
   int x[n]={5,2,3,8,7};
   int i, j;
   int p;
   for (i=1; i < n; i++)
   {
	   j = i; p = x[i];
	   while (x[j-1] > p && j > 0) { x[j] = x[j-1]; j--; }
	   x[j] = p;
   }
   for (i=0; i < n; i++)
	   std::cout << x[i];
   return 0; 
}