Asked how to locate an element in a rotated, sorted array.

You've been given an array that is sorted and then rotated.

Example: Let arr = [1, 2, 3, 4, 5], which is sorted and then rotated twice to the right to give [4, 5, 1, 2, 3].

This can be done in O(log N) using a slightly modified binary search.

The interesting property of a sorted + rotated array is that when you divide it into two halves, at least one of the two halves will always be sorted.

I am not interested in the groups of developing explorers, so I did not proceed.

Asked about how to locate an element in a rotated, sorted array.

You've been given an array that is sorted and then rotated.

Example:

Let arr = [1, 2, 3, 4, 5]. This is sorted and then rotated twice to the right to give [4, 5, 1, 2, 3].