This is golang binary search in recursive form

binary_search.go

package main

//Recursive Binary Search
func binarySearch(numList []int64, key int64) int {

	low := 0
	high := len(numList) - 1

	if low <= high {

		mid := ((high + low) / 2)

		if numList[mid] > key {

			return binarySearch(numList[:mid], key)

		} else if numList[mid] < key {

			return binarySearch(numList[mid+1:], key)

		} else {

			return 1
		}
	}

	return 0
}