Big O Notation Explained: Derive It, Don't Memorize It

You can recite that binary search is O(log n) and nested loops are O(n²). That recitation stops...