Search in a sorted rotated Array | GFG PODT | Leetcode 33 | Easy C++ Solution

The problem is to find the index of a target element in a rotated sorted array. A rotated sorted array is an array that has been sorted in ascending order and then rotated around a pivot point.
The key idea is to use a modified binary search algorithm to find the target element. The algorithm first checks if the left half of the array is sorted. If it is, it checks if the target element falls within the range of the left half. If it does, the algorithm searches the left half. Otherwise, it searches the right half.
If the left half is not sorted, it means the right half is sorted, and the algorithm checks if the target element falls within the range of the right half. If it does, the algorithm searches the right half. Otherwise, it searches the left half.
The algorithm continues to narrow down the search space until the target element is found or the search space is exhausted.
Time Complexity (TC):
The time complexity of this solution is O(log n), where n is the size of the input array. This is because the algorithm uses a modified binary search, which has a logarithmic time complexity.
Space Complexity (SC):
The space complexity of this solution is O(1), as the algorithm only uses a constant amount of extra space to store the low, high, and mid indices. It does not require any additional data structures that grow with the size of the input.
#gfg #binarysearchtree #gfgstreek #leetcode #dsa #dsalgo #programming #computerscience #leetcode #education #computerscience #gfg

[@vineetkukreti2280]

Nicely explained

[@rohitjoshi8719]

@@vineetkukreti2280 Thanks ❣️