3 ms·
Umh, was that Knuth asking him about his log(log(n)) search algorithm?
by brianm 19y ago
Umh, was that Knuth asking him about his log(log(n)) search algorithm?
- kyro 19y agoYes!
- tocomment 19y agoIs that possible?
- jey 19y agoFor comparison-based sorts, no. There are some good links if you google "lower bound of comparison-based sorting algorithms". Knuth's question was a joking reference to http://xkcd.com/342/ http://xkcd.com/342/
- tocomment 19y agoThanks. The comic doesn't mention what the algorithm does. I thought I heard "search" in the lecture not sort.
- jey 19y agoOops, you're right, the 2nd-to-last panel is talking about A* and Dijkstra's search algorithms, but it's not clear what the last panel refers to. I just idiotically had assumed that the last panel was referring to sorting algorithms.
- icky 19y agoThe real question is: did he come on his own, or did some Googler call him up and get him to come as a prank on Randall?