This is a single archived entry from Stefan Tilkov’s blog. For more up-to-date content, check out my author page at INNOQ, which has more information about me and also contains a list of published talks, podcasts, and articles. Or you can check out the full archive.

Broken Binary Search

Stefan Tilkov,

I’m late in linking to this, but I found this very interesting: Nearly all binary searches and mergesorts are broken … if they’re written in mainstream programming languages. Patrick Logan and James A. Robertson show how other languages get around this problem.