static int search(int arr[], int l, int h, int key)
{
if(l>h)
return -1;
int mid=(l+h)/2;
if(arr[mid]==key)
return mid;
if(arr[l]<=arr[h])
{
if(arr[l]<=key && key>=arr[h])
{
return search(arr,l,mid-1,key);
}
return search(arr,mid+1,h,key);
}
else {
if(arr[mid]<=key && key<=arr[h])
{
return search(arr,mid+1,h,key);
}
return search(arr,l,mid-1,key);
}
}