The lack of available information back then is probably hard for today's generation to grasp. The golden age is now!
-
-
As in when you ask "how does merge sort work?" in a skype job interview and they say "ok, lemme google that" sort of way. It really happens!
1 reply 0 retweets 1 like -
I'm on the fence about how terrible that is. It's more important that people know merge sort (a) exists and (b) where you'd use it.
1 reply 0 retweets 4 likes -
Replying to @tom_forsyth @amjazzbre and
In an interview, does it show a lack of knowledge? Sure. But does that matter for real-world work? Not sure. My go-to is red-black trees.
2 replies 0 retweets 3 likes -
Replying to @tom_forsyth @amjazzbre and
At multiple times in my life I have known how a red-black tree works. But 99% of the time I can't be bothered storing that knowledge!
3 replies 0 retweets 12 likes -
I have never used a red-black tree, and I would have to google to answer anything about characteristics. <googling>
4 replies 3 retweets 29 likes -
-
Replying to @paniq @ID_AA_Carmack and
The only way for any data structures to actually be O(1) on a virtual memory machine is for them to have bounded size.
1 reply 0 retweets 5 likes -
(to which the nit-picky reply is that luckily, everything that can possibly be addressed by a machine with finite memory is bounded size.)
1 reply 0 retweets 6 likes -
"it's not O(1), it's O(sqrt(N)/c), where c is the speed of light"
2 replies 1 retweet 10 likes
or in a more permissible and less physical universe, still log(input size) since that's the number of input steps
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.