Implement binary search 1

[sneha-tambade]

No description provided.

[super30admin]

• The student's solution is well-implemented and correctly solves the problem. The approach of identifying the sorted half and adjusting the search range accordingly is correctly applied.
• The comments and variable names are clear, making the code easy to understand.
• One minor improvement could be to use mid = left + (right - left) / 2 instead of mid = (left + right) / 2 to avoid potential integer overflow, although in practice, this is unlikely to be an issue for typical problem constraints.