for 64 bit size_t it's pretty academic, but no, not correct. suppose low is M-3 and high is M-1 (where M is 2^[#bits]) then mid should be M-2. but (M-3 + M-1)

for 64 bit size_t it's pretty academic, but no, not correct. suppose low is M-3 and high is M-1 (where M is 2^[#bits]) then mid should be M-2. but (M-3 + M-1) is (modulo M) equal to M-4. and half that is M/2 - 2, which is a lot less than the correct M-2. (pretend it's 2 bit unsigned ints so M is 4) the correct 'mid' computation is low + (high - low)/2.