//InsertionSort(Array[])
//for i = 1 to Array.Length
//key = Array[i]
//while j >= 0 and Array[i] > key
//  Array[j + 1] = Array[i]
//  j = j - 1
//Array[j + 1] = key

public static int[] InsertionSort(int[] integerArray) {

	int temp;
	int j;

	for (int i = 1; i < integerArray.Length; i++) {

		temp = integerArray[i];
		j = i - 1;

		while (j >= 0 && integerArray[j] > temp) {
			integerArray[j + 1] = integerArray[j];
			j--;
		}
		integerArray[j + 1] = temp;
	}
	return integerArray;
}