Insertion Sort – Java Source Code Snippet
public static void sort(int[] a)
{
for (int i = 1; i < a.length; i++)
{
int current_val= a[i];
int j= i;
while(j > 0 && a[j-1] > current_val)
{
a[j]=a[j-1];
j--;
}
a[j]=current_val;
}
}