Skip to content

Glossary: Data Structures and Algorithms in Go

Insertion sort

Sorting by taking each item and sliding bigger ones right to drop it into place, like sorting a hand of cards. It is O(n²) but fast on nearly sorted data.

Where the book teaches it

Related terms

Merge sortShifting