Files
grokking_algorithms/01_introduction_to_algorithms/Golang/BinarySearch.go
2021-03-14 10:43:52 -05:00

26 lines
398 B
Go

package main
import "fmt"
func checkBin(list []int, i int) int {
low := 0
high := len(list) - 1
for low <= high {
mid := (low + high) / 2
if list[mid] == i {
return mid
}
if list[mid] < i {
low = mid + 1
} else {
high = mid - 1
}
}
return -1
}
func main() {
fmt.Println(checkBin([]int{1, 2, 3, 4, 5}, 1)) // 0
fmt.Println(checkBin([]int{1, 2, 3, 4, 5}, -1)) // -1
}