News for hackers. Stuff that matters.
Re:Nearly All Binary Searches and Mergesorts are Broken (2006) by im3w1l on Thursday July 09, 2015 @08:22PM (#9861614)
He uses the cint which forces to int.

Ninjaedit: cint is used for the midpoint, and is then assigned to either the upper or lower limit. After 2 or more iterations, both upper and lower limits can be ints.

Re:Nearly All Binary Searches and Mergesorts are Broken (2006) by abecedarius on Thursday July 09, 2015 @08:36PM (#9861674)
After the sum and division.