Search in Rotated Sorted Array | Problem of the Day | GeeksForGeeks

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.
Examples :
Input: arr[] = [5, 6, 7, 8, 9, 10, 1, 2, 3], key = 10
Output: 5
Explanation: 10 is found at index 5.
Input: arr[] = [3, 5, 1, 2], key = 6
Output: -1
Explanation: There is no element that has value 6.
Expected Time Complexity: O(log n)
Expected Auxiliary Space: O(1)
Table of Contents
0:00 Problem Statement
0:52 Solution
5:40 Example 1
9:46 Example 2 - Corner Case
12:20 Pseudo Code
15:50 Code Python
17:25 Code C++

[@mathematics3398]

class Solution: def search(self,arr,key): start = 0 end = len(arr) - 1 while start = arr[start]: end = mid - 1 else: start = mid + 1 else: if key > arr[mid] and key

[@mathematics3398]

class Solution { public: int search(vector& arr, int key) { int start = 0, end = arr.size() - 1; while (start = arr[start]) end = mid - 1; else start = mid + 1; } else { if (key > arr[mid] and key

[@mathematics3398]

Table of Contents 0:00 Problem Statement 0:52 Solution 5:40 Example 1 9:46 Example 2 - Corner Case 12:20 Pseudo Code 15:50 Code Python 17:25 Code C++