Re:How to Pass a Programming Interview
by aidenn0 on Tuesday March 08, 2016 @11:04PM
(#11250839)
This is categorically untrue if you are talking about large numbers and asymptotic complexity. It is true that algorithms with a constant factor larger number of operations may have such properties, but O(n) will always beat O(n^2) eventually, and in nearly all real-world cases at a fairly small n (1000 L1 cache accesses is slower than 1 memory access so n=1000 will be enough to counter any locality issues).
[ Parent
| on HN ]
There are no comments on this comment yet.