Insertion Sort

insertionsort.java

public class InsertionSort
{
  private static int[] a;
  private static int n;

  public static void sort(int[] b)
  {
    a=b;
    n=a.length;
    isort();
  }

  private static void isort()
  {
    int i, j, t;
    for (i=1; i<n; i++)
    {
      j=i;
      t=a[j];
      while (j>0 && a[j-1]>t)
      {
        a[j]=a[j-1];
        j--;
      }
      a[j]=t;
    }
  }
  
}