insertion sort

/**
	 * Sorts a subrange of values in an array of Comparable objects using Insertion Sort
	 * @param data - The array to be sorted
	 * @param start - Beginning index, inclusive
	 * @param end - Ending index, inclusive
	 */
	public static <T extends Comparable<? super T>> void insertionSort(T[] data, int start, int end)
	{
		for(int i = start; i <= end; i++)
		{
			T targetVal = data[i];
			int currentPosition = i;
			while(currentPosition > start && incrementComparisonCount(data[currentPosition -1 ].compareTo(targetVal) > 0))
			{
				data[currentPosition] = data[currentPosition - 1];
				currentPosition--;
			}
			data[currentPosition] = targetVal;
		}
	}