Chapter 12

The process of examining a middle value of a sorted array to see which half contains the value in question and halving until the value is located. (442)

A sorting algorithm that swaps consecutive elements when they are out of order to bubble the elements to the top or bottom on each pass. (448)

A sorting algorithm that locates an insertion point and takes advantage of partial ordering in an array. (449)

The process of searching a list by examining the first component and then examining successive components in the order in which they occur. (442)

An array that uses multiple lists of items. (456)

An array that can represent simple lists of items. (456)

An array with rows of different lengths. (459)

A sorting algorithm puts the smallest or largest element in the top position and repeats the process on the remaining array components.

An array that uses two lists of items. (456)