search in Rotated Sorted Array

public class Solution {    public int search(int[] A, int target) {        int l = 0;        int r = A.length-1;        while(l<=r){            int m = (l+r)/2;            if (target == A[m]){                return m;            }            // If right part is sorted            if (A[m]<A[r]){                if (target>A[m] && target<=A[r]){                    l=m+1;                }else{                    r=m-1;                }            // If left part is sorted                }else{                if (target<A[m] && target>=A[l]){                    r=m-1;                }else{                    l=m+1;                }            }        }        return -1;    }}