Instructions:

This exercise has you perform all of the steps taken by Quicksort, except that the details of the partion step are done for you. Perform your steps according to the highlighted lines in the code until the array has been sorted. The message above the array gives more information about how the steps should be done.

When partitioning, always select the left and right endpoints, even if they are the same element. When processing a sublist of length 1, simply mark the element as sorted. When determining the pivot's final location, treat any elements that match the pivot as if they were larger than the pivot.