Quicksort
•Mergesort, on the other hand,
–runs
somewhere between the Quicksort's best and worst case (insertion sort).
–Sometimes
quicksort is faster; sometimes it is slower!
–The
thing to keep in mind is that the worst case behavior of the mergesort is
about the same as the quicksort's average case.