Complete binary search related problems

[paridhimalviya]

Problem1

Search a 2D Matrix(https://leetcode.com/problems/search-a-2d-matrix/)

Problem2

Search in a Rotated Sorted Array (https://leetcode.com/problems/search-in-rotated-sorted-array/)

Problem3

Search in Infinite sorted array:

https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size/

Given a sorted array of unknown length and a number to search for, return the index of the number in the array. Accessing an element out of bounds throws exception. If the number occurs multiple times, return the index of any occurrence. If it isn’t present, return -1.

[super30admin]

Strengths:

• The student has a good understanding of binary search and its application to rotated sorted arrays.
• The code is well-commented and easy to follow.
• The student has provided multiple solutions, showing a deep understanding of the problem.

Areas for Improvement:

• The condition low < high in searchWithAConditionChange could miss some edge cases. It's better to stick with low <= high to ensure all cases are covered.
• The student could benefit from more concise variable names (e.g., mid instead of midIndex if it were used).
• The additional method searchWithAConditionChange is not necessary and could be confusing. It's better to focus on one correct solution.

[super30admin]

Strengths:

• The student has a good understanding of binary search and its application to rotated sorted arrays.
• The code is well-commented and easy to follow.
• The student has considered edge cases and provided alternative methods for comparison.

Areas for Improvement:

• The searchWithAConditionChange method seems unnecessary and could be removed to simplify the code.
• The initialization and testing code (init()) should be separated from the core logic for better modularity.
• The comments could be more concise and focused on the key insights rather than repeating the problem statement.