> Big-O assumes that only asymptotic behavior matters, but real-world workloads have finite input sizes

Well I did have a CS teacher that said that O(log n) is basically O(1) because in practice, n usually will fit it in a 32bit and log n then is 32 at most :D

It might have been said in jest in part but really it's not that far fetched.