Skip to content

Glossary: Data Structures and Algorithms in Java

insertion point

The index where a value not in a sorted array would go to keep it sorted. `Arrays.binarySearch` returns -(insertion point) - 1 for missing values.

Where the book teaches it

Related terms

Arrays.binarySearch