go BinarySearch

package main

import (
    "fmt"
)

func main() {
    num := []int{1,3,4,6,7,8,10}
    fmt.Println(BinarySearch(num,100))
}

func BinarySearch(lst []int,m int) int {
    low := 0
    heigh := len(lst) - 1
    for (low < high) {
        mid := (low+high)/2
        if (m < lst[mid]){
            high = mid - 1
        }else if(m > lst[mid]){
            low = mid + 1
        }else {
            fmt.Println(m,"found in ",lst)
            return lst[mid]
        }
    }
    fmt.Println(m,"not found in ",lst)
    return -1
}