Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

If you had implemented a simple string search, and then someone told you that it was usually possible to do a string search without examining all the characters of the string, you'd probably come up with some Boyer-Moore variant. Nevertheless it took decades for people to come up with it. It's one of those cases where the basic idea is the really hard part.

Binary search, among the very basic algorithms, is toward the other extreme. An incorrect version of the algorithm was published something like 20 years before a bug-free version was published.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: