Hacker News new | ask | show | jobs
by dvt 2518 days ago
This kind of pedantry doesn't add anything to the discussion. We all know big-O notation is a theoretical abstraction.
1 comments

I think you overestimate the number of programmers that know this. In my experience, < 50% of programmers know that random array lookups are not constant time in practice.

I mean they would be able to deduce it, but they just never made the connection.