Middle element in Binary search python

Question

In python binary search to find the mid value i use:

mid=math.ceil((high+low)/2).

Is ceil more optimal or should I use floor or round?

WellDone2094 · Accepted Answer · 2015-09-02 11:53:47Z

1

for the algorithm there is no difference in performance, i think the only difference is in the cost of the operation, floor should be the easiest one because the computer doesn't need to do anything except remove the floating point part.

answered Sep 2, 2015 at 11:53

WellDone2094

1751 silver badge9 bronze badges

Sign up to request clarification or add additional context in comments.

2 Comments

Mathan Over a year ago

In general [not specific to python] which one can i use, ceil or floor?

WellDone2094 Over a year ago

you can use both, just remember that in some case for example with low=0 and high=1 you can get stuck there forever so you have to check that the low and high are changed since the last cycle. there is no performance difference.

Collectives™ on Stack Overflow

Middle element in Binary search python

1 Answer 1

2 Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

2 Comments

Your Answer

Sign up or log in

Post as a guest

Related