regular reminder for next time you do big-O complexity analysis: memory access is not really O(1)... it's actually at a minimum O(log(N)).
-
-
Replying to @FioraAeterna
@FioraAeterna Yes, but see https://en.wikipedia.org/wiki/Transdichotomous_model …. Basically all big-O claims assume one.1 reply 0 retweets 0 likes -
Replying to @RichFelker
@FioraAeterna Interesting anecdote: in grad school a colleague trying to prove an obviously-false big-O claim (implied a lang was regular)..1 reply 0 retweets 0 likes
@FioraAeterna ...because the actual storage for an integer in range 0..N is not O(1) but O(log N).
11:53 AM - 15 Oct 2015
0 replies
0 retweets
1 like
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.