golang 算法课 二分查找模板

func binarySearch(arr []int, l, r, x int) int {

	if r < l {
		return -1
	}

	mid := l + (r-l)/2

	if arr[mid] == x {
		return mid
	}

	if arr[mid] > x {
		return binarySearch(arr, l, mid-1, x)
	}

	return binarySearch(arr, mid+1, r, x)
}