Search in Rotated array

public class Solution {
    public static int search(int arr[], int key) {
        // Write your code here.
            int low=0;
    int n=arr.length;
    int high=n-1;

    while(low<=high)

    {

        int mid=(low+high)/2;

        if(arr[mid]==key) return mid;

        if(arr[low]<=arr[mid]) // left sorted array

        {

            if(key>=arr[low] && key<arr[mid])

            {

                high=mid-1;

            }

            else{

                low=mid+1;

            }

        }

        else if(arr[low]>=arr[mid]) //right sorted array

        {

            if(key>arr[mid] && key<=arr[high])

            {

                low=mid+1;

            }

            else{

                high=mid-1;

            }

        }

    }

    return -1;
    }
}