Binary Search

binary-search.c

int bsa(int a[], int n, int t) {
    int lft = 0, rgt = n - 1;
    while (lft <= rgt) {
        int m = (lft + rgt) / 2;
        if (a[m] < t) {
            lft = m + 1;
        } else if (a[m] > t) {
            rgt = m - 1;
        } else {
            return m;
        }
    }
    return -1;
 

binary-search.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
}

binary-search.py

from math import floor
def bsa(a, n, t):
    lft = 0
    rgt = n -1
    while lft <= rgt:
        m = floor((lft + rgt) / 2)
        if a[m] < t:
            lft = m+1
        elif a[m] > t:
            rgt = m-1
        else:
            return m
    return -1