easy5 pts · first answer countsarraysbinary-searchoverflow

Safe midpoint in binary search

In Java or C++, why is mid = lo + (hi - lo) / 2 preferred over (lo + hi) / 2?

A.It rounds the midpoint up instead of downB.It makes the search return the first matchC.lo + hi can overflow a 32-bit int for large indexesD.It avoids a division by zero when lo is 0

Discussion 0

Join free to post in the discussion.

Safe midpoint in binary search

Discussion 0

Related questions