Sorting algorithm: Direct insertion method

DirectInsertion.java

	public void sort(int[] elements) {
		int j;
		int pivot;
		
		for (int i =  1; i < elements.length; i++) {
			pivot = elements[i];
			j = i-1;
			
			while (j >= 0 && pivot < elements[j]) {
				elements[j+1] = elements[j];
				j--;
			}
			
			elements[j+1] = pivot;
		}
	}