Method quickSort

java/Chapter 11/Introduction/Quicksort.java:36–44

(int arr[], int left, int right)

	}
	
	public static void quickSort(int arr[], int left, int right) {
		int index = partition(arr, left, right); 
		if (left < index - 1) { // Sort left half
			quickSort(arr, left, index - 1);
		}
		if (index < right) { // Sort right half
			quickSort(arr, index, right);
		}
	}
	
	public static void main(String[] args) {
		int[] arr = AssortedMethods.randomArray(20, 0, 20);