JAVA:

Write a simple recursive method for Quicksort in Java(sort integer in an array).

---> Assume that you have the following methods:

1) pickPivot(int[] array) that returns the array index of a pivot.

2) pivotArray(int[] array, int pivotIndex) that places all values in the array less than or equal to the value of the pivot to the left of the pivot and all values greater than the value of the pivot to the right of the pivot.

PLEASE COMMENT THE CODE SO I CAN LEARN AS WELL. THAKS