Page 455 - AP Computer Science A, 7th edition
P. 455
Analysis of Mergesort:
1. The major disadvantage of mergesort is that it needs a
temporary array that is as large as the original array to be
sorted. This could be a problem if space is a factor.
2. Mergesort is not affected by the initial ordering of the elements. Thus, best, worst, and average cases have similar
run times.
Quicksort
Optional topic
For large n, quicksort is, on average, the fastest known sorting algorithm. Here is a recursive description of how quicksort works:
