public void insertionSort(int[] arr)
{
int temp;
int insertionPoint;
for(int i = 1; i < arr.length; i++)
{
temp = arr[i];
insertionPoint = i;
while(insertionPoint > 0 && temp < arr[insertionPoint-1])
{
arr[insertionPoint] = arr[insertionPoint-1];
insertionPoint--;
}
arr[insertionPoint] = temp;
}
}