Chapter 12

Question 1

binary search

Answer 1

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)

Question 2

bubble sort

Answer 2

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)

Question 3

insertion sort

Answer 3

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

Question 4

linear search

Answer 4

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

Question 5

multidimensional array

Answer 5

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

Question 6

one-dimensional array

Answer 6

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

Question 7

ragged array

Answer 7

An array with rows of different lengths. (459)

Question 8

selection sort

Answer 8

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

Question 9

two-dimensional array

Answer 9

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