C++ Chapter 8

Using a linear search to find a value that is stored in the last element of an array of 20,000 elements, ________ element(s) must be compared.

20,000

Regardless of the algorithm being used, a search through an array is always performed ________.

None

________ algorithms are used to arrange random data into some order.

Sorting

A(n) ________ search is more efficient than a ________ search.

binary, linear

When an array is sorted from highest to lowest, it is said to be in ________ order.

descending

Data that is sorted in ascending order is ordered ________.

from lowest to highest

A(n) ________ search uses a loop to sequentially step through an array.

linear

The ________ is adequate for searching through small arrays.

linear search

A binary search begins with the ________ element of an array.

middle

The advantage of a linear search is its ________.

simplicity

Array elements must be ________ before a binary search can be performed.

sorted

A ________ algorithm is a method of locating a specific item of information in a larger collection of data.

search

The ________ sort usually performs fewer exchanges than the ________ sort.

selection, bubble