Things I have literally never had to use in my career (outside interviews) includehttps://twitter.com/EmilyKager/status/967165799071809536 …
-
-
Replying to @mjg59
I think I reported a DoS bug once, in a base64 decoder that had O(n^2) complexity. and IIRC the reason for the existence of the kcmp() syscall is that it permits doing an operation in O(n log n) instead of O(n^2) time. but none of that requires knowing how to write big-O proofs
2 replies 0 retweets 6 likes -
just "count nested loops" and "drop the constants"
1 reply 0 retweets 6 likes
(and in real life, you might not actually want to drop the constants...)
11:23 AM - 24 Feb 2018
0 replies
0 retweets
2 likes
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.

