Insertion Sort in Java

public static void insertionSort (int[] inputData) {
	for (int forwardPointer = 1; forwardPointer < inputData.length; forwardPointer++) {
		int selectElement = inputData[forwardPointer];
		int reversePointer = forwardPointer -1;
		while (reversePointer >= 0 && selectElement < inputData[reversePointer]) {
			inputData[reversePointer+1] = inputData[reversePointer];
			reversePointer--;
		}
		inputData[reversePointer + 1] = selectElement;
	}
}