Golang实现基本查找算法
package mainimport (“bufio”“fmt”“os”“strconv”“strings”)func binarySearch(data []int, key int) int {// 二分查找left := 0right := len(data) - 1for {if left > right { // 小于等于break}mid := (right-left)/2 + left // 等价于 (a+b)/2,防止a+b过大if data[mid]
