public class Exercise8
{
  public static void sort(int[] a)
  {
    int i = 0;
    int n = a.length;
    while (i < n)
    {
      insert(a, i);
      i = i+1;
    }
  }

  public static void insert(int[] a, int n)
  {
    int i = n;
    int t = a[i];
    while (i > 0 && a[i-1] > t)
    {
      a[i] = a[i-1];
      i = i-1;
    }
    a[i] = t;
  }
}