Completed Binary Search 1

[restacksyj]

No description provided.

[super30admin]

Strengths:

• Correct implementation of binary search for rotated sorted array
• Proper handling of edge cases
• Achieves optimal time and space complexity

Areas for improvement:

• Submit only the relevant solution file (Exercise2.cpp) without binary files
• Use more descriptive variable names (e.g., 'low' and 'high' instead of 'l' and 'r')
• Add comments explaining the logic, especially the conditions for determining which half is sorted
• Ensure consistent code formatting (indentation, spacing)
• Remove duplicate files (Exercise2_exp.cpp appears to be identical to Exercise2.cpp)

The solution would benefit from:

1. Better organization (single file submission)
2. Improved readability through better naming and comments
3. Removal of unnecessary files