Quicksort
•On the next recursive call there are
N-2 comparisons,
etc.
–This will continue leaving the left
hand side empty doing comparisons until the size of the unsorted area is
only 1.
–Therefore, there are N-1 levels of
recursion and 1+2+...+(N-1) comparisons...which is: N*(N-1)/2.
–The good news that in this case there
are no exchanges.