Exam 8: Searching and Sorting Arrays

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

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

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

A linear search can only be implemented with integer values.

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

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

The ________ is adequate for searching through small arrays.

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

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

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

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

The advantage of a linear search is its ________.

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.

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

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

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

Data that is sorted in ascending order is ordered ________.

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

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

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