scratch: algos/binary_search.go (master)

scratch/algos/binary_search.go (view raw)

package algos

func BinarySearch(arr []int, target int) int {
	lo, hi := 0, len(arr)-1
	for lo <= hi {
		mid := lo + (hi-lo)/2
		if arr[mid] == target {
			return mid
		} else if arr[mid] < target {
			lo = mid + 1
		} else {
			hi = mid - 1
		}
	}
	return -1
}

1	package algos
2
3	func BinarySearch(arr []int, target int) int {
4	lo, hi := 0, len(arr)-1
5	for lo <= hi {
6	mid := lo + (hi-lo)/2
7	if arr[mid] == target {
8	return mid
9	} else if arr[mid] < target {
10	lo = mid + 1
11	} else {
12	hi = mid - 1
13	}
14	}
15	return -1
16	}