Skip to content

Glossary: Data Structures and Algorithms in Go

Linear search

Checking items one by one from the start until you find the target. It is O(n), like `findOrder` for Priya's order IDs.

Where the book teaches it

Related terms

Binary searchWorst case