Binary search implementation using golang.

binary_search.go

package main

import "fmt"

func elementExists(input_array []int, max_index int, min_index int, element int) bool {
	middle_index := (min_index + max_index) / 2
	found := false

	if min_index > max_index {
		return false
	}

	if element == input_array[middle_index] {
		found = true
	} else if element < input_array[middle_index] {
		max_index := middle_index - 1
		return elementExists(input_array, max_index, min_index, element)
	} else if element > input_array[middle_index] {
		min_index := middle_index + 1
		return elementExists(input_array, max_index, min_index, element)
	}
	return found
}

func main() {
	input_array := []int{5, 9, 12, 14, 16, 17, 98, 100, 101, 123, 900}
	element := 10000
	min_index := 0
	max_index := len(input_array) - 1

	found_it := elementExists(input_array, max_index, min_index, element)
	fmt.Println(found_it)
}