Method partition

java/Chapter 18/Question18_6/QuestionC.java:81–96

(int[] array, int left, int right, int pivot)

	}
	
	public static int partition(int[] array, int left, int right, int pivot) {
		while (true) {
			while (left <= right && array[left] <= pivot) {
				left++;
			}
			
			while (left <= right && array[right] > pivot) {
				right--;
			}
			
			if (left > right) {
				return left - 1;
			} 
			swap(array, left, right);
		}
    }	
	
	public static int rank(int[] array, int left, int right, int rank) {
		int pivot = array[randomIntInRange(left, right)];