Solution: Search in Rotated Sorted Array
Explore how to solve the rotated sorted array search problem by applying a modified binary search algorithm. Learn to identify sorted halves, adjust search boundaries, and implement an efficient O(log n) time solution that returns the target index or -1 if absent.
Statement
You are given a sorted integer array, nums, and an integer, target. The array may have been rotated by an arbitrary number. Your task is to find and return the index of target in this array. If target does not exist, return -1.
An original sorted array before rotation is given below:
After rotating this array 6 times, it changes to:
Constraints:
- All values in
numsare unique. - The values in
numsare sorted in ascending order. - The array may have been rotated by some arbitrary number.
-
nums.length -
nums[i]