Practicing bisect in Go

morristai01@gmail.com (Morris) — Tue, 05 May 2020 11:46:56 +0800

In Python, we are used to using bisect to search for elements in the List. In Go, sort.Search() can also provide us with the same purpose. As in Python, the target array is sorted before searching.

1
2


arr := []int{9, 2, 1, 3, 6, 4, 5, 5}
sort. Ints(arr)

After sorting, we use sort.Search(), the first parameter is the search target, and the second is the function of the search condition. Here we input slice: [1 2 3 4 5 5 6 9], find the 5 closest to the left, and the program returns the index 4.

Binary Search on 300.Watts

Practicing bisect in Go