-----QUESTION-----
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7
4 5 6 7 0 1 2
).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
-----SOLUTION-----
class Solution {
public:
int search(int A[], int n, int target) {
int i;
for (i = 0; i < n; i++)
{
if(A[i] == target) break;
}
if(i == n) return -1;
return i;
}
};