Upvoted for the first two paragraphs, but I can't make sense of the second sente...

arundelo on Jan 31, 2012 | parent | context | favorite | on: Nearly all binary search and merge sort implementa...

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.

nknight on Jan 31, 2012 [–]

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. :)