Convert pseudocode to Java

InsertionSort(list, N)

// list the elements to be put into order

// N the number of elements in the list

for i=2 to N do

newElement = list[i]

location = i - 1

while (location >= 1) and (list[location] > newElement) do

// move any larger element out of the way

list[location + 1] = list [location]

location = location - 1

end while

list[location + 1] = newElement

end for