About this document
Mergesort vs Quicksort Analysis by ModernZen is a document available to read on EtoBox.
Mergesort and quicksort are two of the most efficient sorting algorithms, both able to sort a list in O(n log n) time on average. While quicksort has better worst-case complexity of O(n), mergesort uses less space of O(1). For large datasets stored externally, mergesort will perform faster. The best algorithm to use depends on factors like data size and whether it fits in memory.
- Author
- ModernZen
- Language
- EN