News for hackers. Stuff that matters.

A comment on Fast midpoint between two integers without overflow. Parent comment

Re:Fast midpoint between two integers without overflow by tromp on Wednesday December 07, 2022 @08:55AM (#33894337) 

    if a > b { 
      mid = (a-b)/2
That only avoids overflow on unsigned types (where it would be called wraparound) ...
[ Parent | on HN ]
Re:Fast midpoint between two integers without overflow by eloff on Wednesday December 07, 2022 @09:01AM (#33894394)
The point of the midpoint calculation is to find the mid-index usually (e.g. binary search, quicksort). So a and b would be unsigned. You're right about signed integers though.
[ Parent | on HN ]