Completed Binary Search 1 problems

[varnika-98]

No description provided.

[super30admin]

Strengths:

1. Correct implementation of binary search for rotated sorted arrays.
2. Good use of comments to explain the logic.
3. Proper handling of edge cases and mid calculation to prevent overflow.
4. Efficient time and space complexity matching the reference solution.

Areas for Improvement:

1. Focus on submitting only the relevant solution for the problem being evaluated. Including unrelated solutions can be confusing.
2. While the comments are helpful, they could be more concise. For example, the comment "to take care of integer overflow in other languages" is not necessary in Python since it handles big integers natively.
3. The variable names are clear, but consistency in naming conventions (like using left and right consistently) is good practice.