二分查找 #

package main

func main() {
	l := []int{1, 3, 5, 7, 9, 11}
	result := binarySearch(l, 11)
	println(result)
	//println(1 / 2)
}

func binarySearch(list []int, item int) int {
	low := 0
	high := len(list) - 1
	println("high: ", high)

	for low <= high {
		mid := (high + low) / 2
		guess := list[mid]
		println("mid: ", mid)
		println("guess: ", guess)

		if guess == item {
			return mid
		}
		if guess > item {
			high = mid - 1
		} else {
			low = mid + 1
		}
	}

	return -1
}