Merge pull request kothariji#763 from Tusharr0305/patch-1

Create 33.leetcode_search_in_rotated_array.cpp

Author: kothariji

binarysearch-problems/33.leetcode_search_in_rotated_array.cpp

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