Sorting - Insertion Sort

public static int[] insertionSort( int[] a)
{
   int v, j;
   for (int i = 1; i < a.length; i++)
   {
      v = a[i];
      j = i-1;
      while ( j >= 0 && a[j]> v)
            a[j+1]= a[j--];
      a[j+1]=v;
      }
   return a;
}