Binary Search Implementation in Golang

binarysearch.go

package main

import "fmt"

func Binarysearch(a []int, key int) bool {
	left := 0
	right := len(a)

	for left <= right {
		mid := (left + right) / 2
		if a[mid] == key {
			return true
		} else if a[mid] > key {
			right = mid - 1
		} else {
			left = mid + 1
		}
	}
	return false
}

func main() {
	arr := []int{1, 2, 3, 4, 5, 6, 7, 8, 9}
	fmt.Println(Binarysearch(arr, 5))
}