| Quicksort |
|
|
|
|
|
|
|
|
|
| • | The
worst case with this method is when one |
|||||||
| of
the regions (left or right) remains empty |
||||||||
| (i.e.,
the pivot value was the largest or |
||||||||
| smallest
of the unknown region). |
||||||||
| • | This
means that one of the regions will only |
|||||||
| decrease
in size by only 1 number (the pivot) |
||||||||
| for
each recursive call to Quicksort. |
||||||||