Solution: Search in Rotated Sorted Array
Explore how modified binary search can be applied to locate a target in a rotated sorted array. Understand the step-by-step process to divide the array, identify the sorted half, and adjust search boundaries for efficient lookup. This lesson helps you implement and analyze the solution with optimal time and space complexity.
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]