The Binary Search Algorithm

In this lesson you will learn how to implement binary search in Go, and understand the thinking behind searching efficiently. This is for anyone searching for "Go binary search implementation".

Binary search finds a value efficiently in already-sorted data. Picture opening a dictionary in the middle and halving the range you still have to look through each time.

The sample code computes the midpoint mid from the two boundaries low and high, compares it with the target, and updates low or high to narrow the range. Compared with checking each item from the start, it finds the value dramatically faster as the data grows.

A common stumbling block for beginners is that binary search requires the slice to be sorted first. Sorted input is a precondition, so do not skip that step.

In real-world development the standard library also provides sort.Search, which is widely applied when you need to find a value quickly in a large data set.

📖 Reference code

package main

import "fmt"

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

func main() {
    nums := []int{1, 3, 5, 7, 9, 11}
    fmt.Println(binarySearch(nums, 7))
    fmt.Println(binarySearch(nums, 4))
}

✍️ Your code

Type your code, then press "Run"

🧪 This site can't compile or run Go directly, so it checks on the spot whether what you typed matches the reference code (scoring happens entirely in your browser — nothing is sent anywhere).