Re:Nearly All Binary Searches and Mergesorts Are Broken (2006)
by gfody on Friday July 22, 2016 @11:14PM
(#12148173)
Yep, this is just vintage click-bait.. you can bet more than sorting routines will fail with numbers approaching 2^63. It doesn't matter because if you're running quick sort on a list of 2^64 entries then something else is going wrong before your (l+r)/2 has a chance to overflow.
[ Parent
| on HN ]
Re:Nearly All Binary Searches and Mergesorts Are Broken (2006)
by colejohnson66 on Saturday July 23, 2016 @02:47AM
(#12148629)
If you're trying to sort 2^63 items at once, you have other problems.
Re:Nearly All Binary Searches and Mergesorts Are Broken (2006)
by mrich on Saturday July 23, 2016 @01:55AM
(#12148533)
int in Java and C is 32 bit wide, not 64 bit, this limit is easily reached.
You cannot just assume nobody will use your algorithms with large inputs and act like your data types have unlimited range. Such bugs will typically manifest at important customers and be hard to analyze. Better think about your types beforehand and do add runtime checks!