COP2000 CHp 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

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

False

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

False

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

False

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

True

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

True

A ____________ 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

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

false

Data that is sorted in ascending order is ordered

lowest to highest

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

search

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

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

sorting

algorithms are used to arrange random data into some order.

sorting