Skip to content

Glossary: Data Structures and Algorithms in Java

insertion sort

A sort that goes through the array and slides each item into place among the sorted items before it, 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