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

Using a binary search, you are more likely to find an item than if you use a linear search

False

The number of comparisons made by a binary search is expressed in powers of two

True

A linear search can only be implemented with integer values

False

Before you can perform a bubble sort, the data must be stored in descending order

False

The bubble sort is an easy way to arrange data into ascending order, but it cannot arrange data into descending order.

False

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

None of these

___________ algorithms are used to arrange random data into some order

Sorting

In the average case, an item is just as likely to be found near the beginning of an array as near the end

True

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

binary, linear

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

descending

Before you can perform a selection sort, the data must be stored in ascending order.

false

Data that is sorted in ascending order is ordered

from lowest to highest value

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

The _________ sort usually performs fewer exchanges than the ________ sort

selection, bubble

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

search