Search in Rotated Array - Implementation

Here is the implementation:

function search(nums, target):
    left = 0
    right = nums.length - 1

    while left <= right:
        mid = (left + right) / 2

        if nums[mid] == target:
            return mid

        if nums[left] <= nums[mid]:
            if nums[left] <= target < nums[mid]:
                right = mid - 1
            else:
                left = mid + 1
        else:
            if nums[mid] < target <= nums[right]:
                left = mid + 1
            else:
                right = mid - 1

    return -1

This runs in $O(\log n)$ time and $O(1)$ space (excluding input).