Skip to content

Create Search in Rotated Sorted Array #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
rahul22mrk wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create Search in Rotated Sorted Array #5

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
32 changes: 32 additions & 0 deletions Search in Rotated Sorted Array
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
int search(vector<int>& nums, int target) {
if (nums.size() == 0) return -1;

int left = 0, right = nums.size()-1;
int start = 0;
//1. find index of the smallest element
while(left < right) {
int mid = left + (right-left)/2;
if (nums[mid] > nums[right]) {
left = mid +1;
} else right = mid;
}

//2. figure out in which side our target lies
start = left;
left = 0;
right = nums.size()-1;
if (target >= nums[start] && target <= nums[right])
left = start;
else right = start;

//3. Run normal binary search in sorted half.
while(left <= right) {
int mid = left + (right - left)/2;
if (nums[mid] == target) return mid;

if (nums[mid] > target) right = mid-1;
else left = mid + 1;
}

return -1;
}