Not all sorting algorithms are created equal. Understanding the difference between O(N log N) and O(N^2) is just the beginning of choosing the right tool.
Comparison-Based vs. Distributed
Quicksort and mergesort compare values directly. Distributed sorts like Counting Sort don't—they count frequencies instead, allowing them to reach O(N) in specific cases with limited value ranges.
Stability and In-Place Sorting
A stable sort (like Merge Sort) preserves the relative order of equal elements. An in-place sort (like Quick Sort) uses no extra memory, which is critical when system resources are tight.
The Hybrid Approach
Modern languages often use hybrid sorts like Timsort (Python/Java), which combines Merge Sort and Insertion Sort to exploit patterns already existing in real-world data.