Exam 9: Searching, Sorting, Algorithm Analysis

The advantage of a linear search is that

Sorted data can be ordered

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

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

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

If algorithm A requires 2n + 1 basic operations to process an input of size n, and Algorithm B requires 3n + 2 basic operations to process the same input, algorithm A is considered to be more efficient than Algorithm B.

The ________ search is adequate for searching through small arrays, but not through large ones.

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

A search can be performed on an array of

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

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

When sorting an array of objects, if the values in the data member being sorted on are out of order for two objects, those two data values should be swapped.

When searching for an item in an unordered set of data, binary search can find the item more quickly than linear search.

Bubble sort and selection sort can also be used with STL vectors.

When sorting an array of objects, if the values in the data member being sorted on are out of order for two objects, it is necessary to

A sorting algorithm can be used to arrange a set of ________ in ________ order.

We can estimate the ________ of an algorithm by counting the number of basic steps it requires to solve a problem.

The linear search is adequate for searching through ________ arrays, but not through ________ ones.

We can measure the complexity of an algorithm that solves a computational problem by determining the number of ________ for an input of size n.

A(n) ________ algorithm arranges data into some order.