def search_rotated_array(nums: list[int], target: int) -> int:
    
    def rec(il,ir): 
        m = (il+ir)//2
        if nums[m]==target:
            return m
        if il>=ir:
            return -1
        if nums[m]>=nums[il]:
            if target >= nums[il] and target<=nums[m]:
                return rec(il,m-1)
            else:
                return rec(m+1,ir)

        if nums[m]<=nums[ir]:
            if target <= nums[ir] and target>=nums[m]:
                return rec(m+1,ir)
            else:
                return rec(il,m-1)

        return -1
    
    return rec(0,len(nums)-1)