Exam 9: Searching, Sorting, and Algorithm Analysis

A search can be performed on an array of

To determine that a item is not in an unordered array of 100 items, linear search must examine an average of values.

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

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, algorithms A and B are considered to be equally efficient.

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

To locate a value that is in an ordered array of 50 items, linear search must examine at most values.

A binary search begins by examining the _ element of an array.

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

To locate a value in an ordered array of 100 items, binary search must examine at most values.

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

A(n)________search is more efficient than a(n)________search.

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

The advantage of a linear search is that

The________ sort usually performs fewer exchanges than the________ sort.

When sorting an array of objects or structures, one must decide which data item to sort on.

A binary search requires that the elements be in order.