使用二分法在一个有序列表中查找某个数在列表中的位置
时间复杂度
时间复杂度:O(log(n))
实现
def search(key, alist: list):
left = 0
right = len(alist) - 1
while left <= right:
mid = (left + right) >> 1
if key > alist[mid]:
left = mid + 1
elif key < alist[mid]:
right = mid - 1
else:
return mid
else:
return -1
if __name__ == '__main__':
alist = [11, 13, 22, 45, 46, 99]
print(search(46, alist))
go版本
package main
import "fmt"
func binSearch(arr []int, findData int) int {
low := 0
high := len(arr) - 1
for low < high {
mid := (low + high) / 2
if arr[mid] > findData {
high = mid - 1
} else if arr[mid] < findData {
low = mid + 1
} else {
return mid
}
}
return -1
}
func main() {
arr := make([]int, 1024*1024, 1024*1024)
for i := 0; i < 1024*1024; i++ {
arr[i] = i + 1
}
id := binSearch(arr, 1024)
if id != -1 {
fmt.Println(id, arr[id])
} else {
fmt.Println("没找到数据!")
}
}