CS2 Chapter 8

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

The ________ is adequate for searching through small arrays.

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.

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

Regardless of the algorithm being used, a search through an array is always performed ________. from lowest to highest element from highest to lowest element beginning with the middle element using a binary search

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

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

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

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

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

Data that is sorted in ascending order is ordered ________.

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

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

True/False: A linear search can only be implemented with integer values.

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

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

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

True/False: The number of comparisons made by a binary search is expressed in powers of two.

True/False: A linear search can only be implemented with integer values.

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

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

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