Completed Binary-Search-1 problems

[SaiSaranPathuriNEU]

No description provided.

[super30admin]

• The student's solution for the rotated sorted array problem is well-implemented and matches the expected time and space complexity.
• The comments and explanations are clear and helpful, making the code easy to understand.
• The student has correctly handled the edge cases and the logic for identifying sorted portions of the array is accurate.
• One minor improvement could be to add a brief comment explaining why the condition nums[mid] >= nums[low] is used to identify the left sorted array, as this might not be immediately obvious to all readers.