Intro

Sorting arranges elements in a specific order. Once data is sorted, you can binary search in $O(\log n)$, find duplicates in $O(n)$, and merge arrays efficiently. Without sorting, many problems require $O(n^2)$ brute force. With sorting, they become $O(n \log n)$.

I'll teach you comparison-based sorts (selection, insertion, merge, quick, heap) and non-comparison sorts (counting, radix). You'll learn when each applies and why library sorts usually win.