martincrb/binary-search-implementation

Mid point

7Rocky opened this issue · 1 comments

7Rocky commented

binary-search-implementation/recursive.cpp

Line 6 in 7fbf8dd

int mid = left + (right - 1) / 2;

I think that the mid point calculation should be like:

int mid = left + (right - left) / 2;
martincrb commented

Yes! I didnt see the issue. You are right! Already fixed in the last commits