Sorting

介紹

屬性：

• stable

• partition

• adaptive

• parallel

記憶體需求：

• O(1)

• O(n)

參考

• Wikipedia - Sorting Algorithm

• Wikipedia - External Sorting

  • a class of sorting algorithms that can handle massive amounts of data

• Wikipedia - Partial Sorting

• Rosetta Code - Sorting Algorithm

• Sort Benchmark

• Rust - slice::sort

  • stable sort

  • need auxiliary memory

  • adaptive, iterative merge sort inspired by timsort

• Rust - slice::sort_unstable

  • unstable sort

  • don’t need auxiliary memory

  • pattern-defeating quicksort

  • combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on slices with certain patterns

• Quicksort

• Merge sort

• Heapsort

• Introsort

• Blocksort

• Cubesort

• Gnome sort

• Smoothsort

• Selection Sort

• Insertion Sort

• Tree Sort

• Tim Sort

• Radix sort

• Bucket sort

• Counting Sort

• Gridsort

  • https://news.ycombinator.com/item?id=26062891