•Also,
notice what would happen if our array is already sorted in ascending order?
•If we
pick a pivot value as the first value, for each recursive call we only decrease the
size by
1 -- and do SIZE-1 comparisons.
•Therefore,
we will have many unnecessary comparisons.
