golang binary search

Ibrahim Albarghouthi answered on April 26, 2022 Popularity 8/10 Helpfulness 6/10

answer golang binary search

golang binary search

Comment

package main

import (
	"fmt"
	"golang.org/x/exp/constraints"
)

func binarySearch[T constraints.Ordered](list []T, value T) int {
	low := 0
	high := len(list) - 1
	for low <= high {
		mid := (low + high) / 2
		if list[mid] > value {
			high = mid - 1
		} else if list[mid] < value {
			low = mid + 1
		} else {
			return mid
		}
	}
	return -1
}

func main() {
	fmt.Println(binarySearch([]int{1, 2, 3, 4, 5, 6, 10, 14, 200, 300}, 14))
}

Popularity 8/10 Helpfulness 6/10 Language whatever

Source: Grepper

Tags: binary-search whatever

Link to this answer
Share Copy Link

Contributed on Apr 26 2022

Ibrahim Albarghouthi

0 Answers Avg Quality 2/10

golang binary search

Contents

More Related Answers

golang binary search

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.