我的文档笔记

//二分查找，data为由小到大排序的数组，target为要找的目标值
func BinarySearch(data []int, target int) int {
    min := 0
    max := len(data)
    for min <= max {
        cur := (min + max) / 2
        println(min, cur, max, target, data[cur])
        if target == data[cur] {
            return cur
        } else if target < data[cur] {
            max = cur - 1
        } else {
            min = cur + 1
        }
    }
    return -1
}