On Dec 29, 2004, at 8:16 AM, Lance Putnam wrote:
I don't think mergesort has anything over quicksort other than a simpleralgorithm.
Mergesort's worst case performance is O(N * log(N)). Quicksort's worst case performance is O(N^2). For large data sets it's possible for quicksort to be significantly slower than mergesort.