search

Documentation

Overview

Package search implements linear and binary search algorithms.

go test -bench=. search/*	# run tests and all benchmarks

See github.com/jreisinger/homepage/blob/master/notes/cs/big-o-notation.md for more.

Level: intermediate Topics: algorithms, testing, benchmarking

Index

• func Binary(list []int, item int) int
• func Linear(list []int, item int) int

Functions

func Binary

func Binary(list []int, item int) int

Binary returns the smallest index of item from a *sorted* list or -1 if not found. Binary search is an O(log n) algorithm.

func Linear

func Linear(list []int, item int) int

Linear returns the smallest index of item from a list or -1 if not found. Linear (or simple) search is an O(n) algorithm.