3 ms·
This kind of pedantry doesn't add anything to the discussion. We all know big-O notation is a theoretical abstraction.
by dvt 7y ago
This kind of pedantry doesn't add anything to the discussion. We all know big-O notation is a theoretical abstraction.
- continuational 7y agoI 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.