# Go: Slice search vs map lookup

DevFeed: [Go: Slice search vs map lookup](<https://devfeed.tech/articles/go-slice-search-vs-map-lookup-35405.md>)

Original publisher: [Read original article](<https://darkcoding.net/software/go-slice-search-vs-map-lookup/>)

Author: Graham King

Published: 2015-06-30T06:09:24Z

Content type: article

Language: en

Sources: [Graham King](<https://devfeed.tech/sources/graham-king.md>)

Topics: [Go Language](<https://devfeed.tech/topics/go-language.md>), [Data structures](<https://devfeed.tech/topics/data-structures.md>), [Benchmark](<https://devfeed.tech/topics/benchmark.md>)

Tags: [array](<https://devfeed.tech/tags/array.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [code](<https://devfeed.tech/tags/code.md>), [data-structure](<https://devfeed.tech/tags/data-structure.md>), [go](<https://devfeed.tech/tags/go.md>), [performance](<https://devfeed.tech/tags/performance.md>), [results](<https://devfeed.tech/tags/results.md>), [slices](<https://devfeed.tech/tags/slices.md>), [software](<https://devfeed.tech/tags/software.md>)

## AI overview

A comparison of Go map lookups and slice searches finds that slices can be faster for very small collections: up to about five items for key-value lookups and ten items for integer-set lookups. Maps are generally the straightforward choice beyond those break-even points.

## Source excerpt

Maps vs. slices: Choose wisely for optimal performance.