33-Search-in-Rotated-Sorted-Array.go

func search(nums []int, target int) int {
    left, right := 0, len(nums) - 1
    
    for left <= right {
        mid := (left + right) / 2
        if target == nums[mid] {
            return mid
        }
        
        // left sorted portion
        if nums[left] <= nums[mid] {
            if target > nums[mid] || target < nums[left] {
                left = mid + 1
            } else {
                right = mid - 1
            }
        // Right sorted portion
        } else {
            if target < nums[mid] || target > nums[right] {
                right = mid - 1
            } else {
                left = mid + 1
            }
        }
    }
    return -1
}