Glossary: Data Structures and Algorithms

Insertion sort

Sorting like a hand of cards: take each item and shift bigger items right to drop it into its place. It is O(n²) but very fast on nearly sorted lists.