Search in rotated sorted array

search.rb

 def search(nums, target)
    if nums.length == 0
        return -1
    end
    low, high = 0, nums.length-1
    
    while low <= high
        mid = (high+low)/2
        if nums[mid] == target
            return mid
        end
        
        if nums[low] <= nums[mid]
             if nums[low] <= target && target < nums[mid]
                 high = mid - 1
             else
                 low = mid + 1
             end
        else
            if nums[mid] < target && target <= nums[high]
                low = mid + 1
            else
                high = mid - 1
            end
        end
        
        
    end
    
    return -1
end