package main

import (
    "fmt"    
)

func bsearch(array []int, target int) int {
    min := 0;
    max := len(array) - 1;
    for max >= min {
        mid := (min + max) / 2;
        if target == array[mid] {
            return mid;
        }
        if target > array[mid] {
            min = mid + 1;
        } else {
            max = mid - 1;
        }
    }
    return -1;
}

func main() {
    array := []int{1, 2, 3, 4, 5};
    fmt.Println("Binary Search");
    fmt.Println("Array:", array);
    for i := 0; i < 7; i++ {
        res := bsearch(array, i);
        fmt.Println(res);
    }
}