JAVA

Implement the pseudocode shown in Snippet 2.8 in Java, calling the partitioning method shown in Snippet 2.7.

The following code block shows the recursive implementation in Java, making use of the partition method developed in the preceding lesson:

Given Code:

import java.util.Arrays;

public class QuickSort {

public void sort(int[] numbers) {

sort(numbers, 0, numbers.length - 1);

}

// Write your code here

private void swap(int[] numbers, int j, int k) {

int temp = numbers[j];

numbers[j] = numbers[k];

numbers[k] = temp;

}

public static void main(String args[]) {

QuickSort quickSort = new QuickSort();

int[] numbers = new int[]{2, 5, 7, 2, 4, 2, 8, 1, 0, 9, 3, 6};

quickSort.sort(numbers);

System.out.println(Arrays.toString(numbers));

}

}

quickSort(array, start, end) if(start