Neoalgo: Correcting binary search in C++

[djm-1]

🐛 Bug Report

In C++ binary search code, mid=(lb+ub)/2. But if lb and ub are both near to INT_MAX then summing up them will give integer overflow. So I want to modify the code to avoid integer overflow.

Have you read the Contributing Guidelines on Pull Requests?

yes

[djm-1]

Please assign this to me and label it for Devscript winter of code.

[Rajat-Jain29]

please assign to me

[djm-1]

I created the issue and I can solve it... assign it to me 😀

[shraddhavp]

assigned @djm-1

[djm-1]

Thank you ma'am

[djm-1]

Please label the difficulty