By bloid
via googleresearch.blogspot.com
Published: Jul 11 2007 / 12:16
I remember vividly Jon Bentley's first Algorithms lecture at CMU, where he asked all of us incoming Ph.D. students to write a binary search, and then dissected one of our implementations in front of the class. Of course it was broken, as were most of our implementations. This made a real impression on me
Comments
rick replied ago:
Kinda old, but if you haven't seen it before it is a very good read.
crowlogic replied ago:
The title should say "most naive implements" are slow, not the algorithms themselves. I spotted the bug instantly upon seeing it and most who study math rather than CS would probably do the same.
Kirill Grouchnikov replied ago:
This is so lame. Read the article - the implementation is broken on inputs having 2^30 or 2^31 entries.
Voters For This Link (14)
Voters Against This Link (2)