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

Joshua Bloch did a great post [1] on how nearly all standard library binary searches and mergesorts were broken (as of 2006) due to this exact issue. The punchline is that the bugs started cropping up when the need and capability to sort O(2^32) element arrays arose.

[1]: https://ai.googleblog.com/2006/06/extra-extra-read-all-about...



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

Search: