Summary of Sort Methods
Sort an collection of n items in ascending order ...
Elementary sorts: O(n2) comparisons
- selection sort, insertion sort, bubble sort
Advanced sorts: O(nlogn) comparisons
- quicksort, merge sort, heap sort (priority queue)
Most are intended for use in-memory (random access data structure).
Merge sort adapts well for use as disk-based sort.
|