Big O Notation Explained: Growth Rate, Not Operation Count

You've read three Big O articles this week. You can recite that hash map lookups are O(1) amortised, that merge sort is O(n log n), that nested loops are O(n²). Then your interviewer writes a function