func search(nums []int, target int) int {
var high = len(nums) - 1
var low = 0
var mid int
for low <= high {
mid = (high + low) / 2
if nums[mid] == target {
return mid
}
if nums[low] <= nums[mid] {
if (target >= nums[low] && target < nums[mid]) {
high = mid - 1
} else {
low = mid + 1
}
} else {
if nums[high] >= target && target > nums[mid] {
low = mid + 1
} else {
high = mid - 1
}
}
}
return -1

}