package algorithm.search;
/**
* The type Search in rotated array.
*/
public class SearchInRotatedArray {
/**
* Search boolean.
*
* @param array the array
* @param a the a
* @param left the left
* @param right the right
* @return the boolean
*/
public static boolean search(int[] array, int a ,int left, int right){
int mid = (left+right)/2;
if(a==array[mid])
return true;
if (right < left)
return false;
if(array[left]