public int[] InsertionSort(int[] nums)
				{
						int endOfArray = nums.Length - 1;
						int temp, index;
						for (int currentIndex = 1; currentIndex < endOfArray; currentIndex++)
						{
								temp = nums[currentIndex];
								index = currentIndex;
								while (index > 0 && nums[index-1] >= temp)
								{
										nums[index] = nums[index - 1];
										index--;
								}
								nums[index] = temp;
						}
						return nums;
				}