Sorting a Million Songs, and the Playlist You Can't Compute: O(n log n) and O(2ⁿ)

See why a good sort handles a million songs in under a second while the obvious ways take most of a day, and why a playlist that fills exactly 60 minutes can't be found by trying every combination: O(n log n) and O(2ⁿ).

Updated

Cheat sheet: Sorting a Million Songs, and the Playlist You Can't Compute: O(n log n) and O(2ⁿ)
Category
Data Structures
Level
Apprentice
Tags
Big-O Notation, Exponential Time, Linearithmic Time, software-development