Glossary: Data Structures and Algorithms

Other O(n log n) sorts (quicksort, heap sort)

Also written: quicksort, heap sort, Quicksort, Heap sort

Quicksort and heap sort are two sorting methods that, like merge sort, run in O(n log n) time. They are common alternatives to merge sort for sorting large lists.