Sorting Overview
Comparison sorts ($\Omega(n\log n)$) vs non-comparison sorts (linear for limited keys); stable vs unstable; in-place vs extra memory.
Easy
Use your language's built-in sort (Timsort/introsort) unless you have special needs.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.