Search In Rotated Sorted Arry Solution

Author: PDKhan

search-in-rotated-sorted-array/PDKhan.cpp

@@ -0,0 +1,28 @@
+class Solution {
+    public:
+        int search(vector<int>& nums, int target) {
+            int start = 0;
+            int end = nums.size() - 1;
+    
+            while(start <= end){
+                int mid = start + (end - start) / 2;
+    
+                if(nums[mid] == target)
+                    return mid;
+                
+                if(nums[start] <= nums[mid]){
+                    if(nums[start] <= target && nums[mid] > target)
+                        end = mid - 1;
+                    else
+                        start = mid + 1;
+                }else{
+                    if(nums[mid] < target && nums[end] >= target)
+                        start = mid + 1;
+                    else
+                        end = mid - 1;
+                }
+            }
+    
+            return -1;
+        }
+    };