Both programs below are supposed to implement QuickSort, but each has a bug that keeps it from correctly sorting the entire list. Run each one, compare the “Sorted array” output to what it should be, and find the mistake.
Look closely at how many times quickSort() calls itself inside its own body. A correct divide-and-conquer sort needs to recurse on both sides of the pivot.
Compare the arguments passed to the two recursive calls to quickSort() here with the version from the previous section. Which array elements are being excluded from further sorting that shouldn’t be?
