binary_search
binary_search.go 源码
package main
//二分查找
//迭代实现
func binarySearch1(data []int, target int) int {
low, high := 0, len(data)-1
for low <= high {
mid := low + (high-low)/2
if target > data[mid] {
low = mid + 1
} else if target < data[mid] {
high = mid - 1
} else {
return mid
}
}
return -1
}
//递归实现
func binarySearch2(data []int, target int) int {
return helper(data, target, 0, len(data)-1)
}
func helper(data []int, target int, low int, high int) int {
if low <= high {
mid := low + (high-low)/2
if data[mid] > target {
return helper(data, target, low, mid-1)
} else if data[mid] < target {
return helper(data, target, mid+1, high)
} else {
return mid
}
}
return -1
}
你可能感兴趣的文章
0
赞
热门推荐
-
2、 - 优质文章
-
3、 gate.io
-
6、 golang
-
7、 openharmony