Files
grokking_algorithms/01_introduction_to_algorithms/Golang/BinarySearch.go
sulinehk e206a13153 Fix BinarySearch.go style by gofmt (#80)
* Fix BinarySearch.go style by gofmt

* Fix longest_common_subsequence.go style by gofmt
2018-07-25 11:01:40 -07:00

26 lines
408 B
Go

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