Rotated Sorted Array Search

Binary-Search/RotatedSortedArraySearch.cpp

@@ -1,5 +1,43 @@
 // https://www.interviewbit.com/problems/rotated-sorted-array-search/
 
+int search1(const vector<int> &arr, int low, int high, int B) 
+{ 
+    if (low > high) return -1; 
+
+    int mid = (low) + (high-low)/2; 
+    if (arr[mid] == B) return mid; 
+
+    if (arr[low] <= arr[mid]) 
+    { 
+        if (B >= arr[low] && B <= arr[mid]) 
+        return search1(arr, low, mid-1, B); 
+
+        return search1(arr, mid+1, high, B); 
+    } 
+
+    else if (arr[mid] <= arr[high])
+    {
+    if (B >= arr[mid] && B <= arr[high]) 
+        return search1(arr, mid+1, high, B); 
+
+    return search1(arr, low, mid-1, B); 
+    }
+} 
+
+
+int Solution::search(const vector<int> &A, int B) {
+
+   int n = A.size();
+   int i = search1(A, 0, n-1, B); 
+
+    if (i != -1) 
+    return i;
+    else
+    return -1;
+
+}
+
+/*
 int findPivot(const vector<int> &A){
     int start = 0;
     int end = A.size()-1;
@@ -64,3 +102,4 @@ int Solution::search(const vector<int> &A, int B) {
     // B < A[pivot]
 
 }
+*/