binary search in Golang

bin_search.go

package main

import (
	"fmt"
)

func binary_search(arr []int, item int) int {
	max := len(arr)
	low := 0
	for low <= max {
		mid := (low + max) / 2
		fmt.Println(low, max, mid)
		if arr[mid] == item {
			return mid
		}

		if arr[mid] > item {
			max = mid - 1
		} else {
			low = mid + 1
		}
	}
	return 0
}

func main() {

	//create test array
	min, max := 1, 100000
	x := make([]int, max)

	for i := range x {
		x[i] = i + min
	}

	fmt.Println(binary_search(x, 1))
}