News for hackers. Stuff that matters.
Re:Nearly all binary search and merge sort implementations a... by pantaloons on Monday January 30, 2012 @02:25PM (#3530216)
I'm tempted to suggest that the fixed C/C++ version is still not correct with respect to this issue, namely on architectures where INT_MAX == UINT_MAX. (Or really INT_MAX <= UINT_MAX < 2 * INT_MAX, which is valid in C99 for INT_MAX >= 65535.)
Re:Nearly all binary search and merge sort implementations a... by caf on Monday January 30, 2012 @07:06PM (#3531141)
INT_MAX == UINT_MAX is the only valid failing case, because elsewhere in the standard integer types are restricted to pure binary representations. This means that if UINT_MAX is greater than INT_MAX, it must be at least INT_MAX * 2 + 1.
Re:Nearly all binary search and merge sort implementations a... by pantaloons on Monday January 30, 2012 @11:38PM (#3531887)
That can't actually be taken for granted, relevant Usenet discussion begins here:

http://groups.google.com/group/comp.std.c/browse_thread/thre...

Re:Nearly all binary search and merge sort implementations a... by caf on Wednesday February 01, 2012 @08:57AM (#3537906)
I concur with Dan Pop's interpretation.