Given a sorted (in ascending order) and rotated array arr of distinct elements which may be rotated at some point and given an element key, the task is to find the index of the given element key in the array arr. The whole array arr is given as the range to search.
Rotation shifts elements of the array by a certain number of positions, with elements that fall off one end reappearing at the other end.
Note: 0-based indexing is followed & returns -1 if the key is not present.
Example 1
Input: arr[] = [5, 6, 7, 8, 9, 10, 1, 2, 3], key = 10
Output: 5
Explanation: 10 is found at index 5.
Example 2
Input: arr[] = [3, 5, 1, 2], key = 6
Output: -1
Explanation: There is no element that has value 6.
Approach, complexity and clean code in every language. Sign in to unlock the editorial.
Your submissions, results and runtime history live here. Sign in to start your streak.
4 5 6 7 0 1 2 0
4
7 8 9 1 2 3 4 3
5
1 1
0
