binary-seach.go

import math

func bsa(a []int, n int, t int) int {
    lft := 0
    rgt := n - 1
    for lft <= rgt {
        m := int(math.Floor(float64((lft + rgt) / 2)))
        if a[m] < t {
            lft = m + 1
        } else if a[m] > t {
            rgt = m - 1
        } else {
            return m
        }
    }
    return -1
}