News for hackers. Stuff that matters.

A comment on Nearly all binary search and merge sort implementations are broken (2006). Parent comment

Re:Nearly all binary search and merge sort implementations a... by arundelo on Tuesday January 31, 2012 @01:34AM (#3532134)
Upvoted for the first two paragraphs, but I can't make sense of the second sentence of the third paragraph. The algorithm given in the article works in Python because Python has different overflow behavior than Java, C, or C++. When you say you "see no evidence", it seems like you are saying the implementation given in the article does work in Java etc.
[ Parent | on HN ]
Re:Nearly all binary search and merge sort implementations a... by nknight on Tuesday January 31, 2012 @02:52AM (#3532303)
Technically, the naïve implementation is perfectly fine for C/C++, so long as size_t is at least 268 bits long on your platform. :)
[ Parent | on HN ]