Skip to content

Conversation

@tanvipandhre
Copy link

Day4 - Search in a Rotated Sorted Array, Search in Infinite sorted array

@super30admin
Copy link
Owner

  • The student's solutions are well-implemented and correctly solve the problems. The logic is clear and follows the expected approach for binary search in rotated sorted arrays and arrays of unknown size.
  • The comments in the code are helpful, but the student could consider adding a brief explanation of the overall approach at the beginning of each method for better clarity.
  • The code follows best practices, such as avoiding integer overflow by using low + (high - low) / 2 instead of (low + high) / 2.
  • The student could improve the README.md by providing more detailed explanations of the problems and solutions, including examples or edge cases.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants