Search the element In Sorted Rotated Array in Java.
Given an array which is sorted in ascending order and is rotated, say for example
Example: original array [1,2,3,4,5,6,7] might become [3,4,5,6,7,1,2]
You are given a key to search. If key is found in the array return its index, otherwise return -1.
Note: You may assume no duplicate exists in the array, find an element in the rotated array in
O(log n) time.
Lets see sample input and output:
