Insertion Sort(Java)

 //Insertion Sort

 for(int i = 1; i < a.length; i++)
 {
     int key = a[i];
     int j;
     for(j = i - 1; j >= 0 && a[j] > key; j--)
         a[j + 1] = a[j];
     a[j + 1] = key;
 }