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)).
@FioraAeterna Interesting anecdote: in grad school a colleague trying to prove an obviously-false big-O claim (implied a lang was regular)..
-
-
@FioraAeterna ...because the actual storage for an integer in range 0..N is not O(1) but O(log N).Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.