Sorting Basics

In this lesson:

• the simple O(n²) sorts vs the efficient O(n log n) sorts
• two properties that decide the choice: stable and in-place
• why insertion sort is the embedded favorite for small / nearly-sorted data
• the memory and worst-case tradeoffs of quicksort, mergesort, heapsort
• when sorting matters, and when you don't need a full sort at all