Java Sorting

The algorithm implementation for the Java Array class could be like the following:
public void insertionSort()
{
int i,j;
for(i=1; i {
int temp = data[i];
j = i;
while (j>0 && data[j-1] >= temp)
{
data[j] = data[j-1];
--j;
}
data[j]=temp;
}
}