Completed Binary Search 1

[Monisha024]

No description provided.

[super30admin]

• Strengths:
  • Correct implementation of binary search in all three problems.
  • Good handling of edge cases (null checks, empty arrays).
  • Clear and consistent coding style across both Java and Python implementations.
  • Proper use of integer division to prevent overflow (mid calculation).
• Areas for Improvement:
  • In problem3, the initial high value could be set more aggressively to reduce the number of steps needed to find the bounds.
  • The condition if nums == None and len(nums) == 0 in problem2.py should be or instead of and to correctly handle both cases.
  • Adding comments to explain the logic, especially in problem2 (rotated sorted array), would make the code more understandable for others.