LC: 702. Search in a Sorted Array of Unknown Size - spiralgo/algorithms GitHub Wiki

702. Search in a Sorted Array of Unknown Size:

The Essence:

As the values are sorted, checking some value at some index can be used as means of determining if the target lies at a greater or a smaller index.

Details:

As the array size is unknown, we can assume some sufficiently large value as the upper boundary of the array size. Hence, textbook binary searching is enough and efficient for this problem.