lostecho/grokking_algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

return position (#188)

Browse Source
This commit is contained in:
Eric Weiss
2021-03-14 11:43:52 -04:00
committed by GitHub
parent 36accc72c6
commit 04823be518
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
01_introduction_to_algorithms/Golang/BinarySearch.go
View File

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