Exam 16: Searching, Sorting and the Vector Type

Assume that n = 1000. To sort the list, bubble sort makes about ____ item assignments.

The insertion sort algorithm sorts the list by moving each element to its proper place.

A variable declared using the vector type is called a ____.

For sorting a list of length n, bubble sort uses ____ iterations.

The type vector provides the expression ____________________, which returns the last element of the object.

All of the values in a list have the same type.

If you initially declare a vector object and do not specify its size, then in order to add elements to the vector object, we use the function ____________________.

The bubble sort makes fewer item assignments than comparisons with a list of 1000 elements.

With the binary search algorithm, ____ key comparison(s) is/are made in the successful case-the last time through the loop.

A sequential search is much faster than a binary search.

If the search item is the 900th item in the list, the sequential search makes ____ key comparisons to determine whether the search item is in the list.

Which of the following statements declares intList to be a vector object of size 10?

Consider the following list: int list[] = {4, 8, 19, 25, 34, 39, 45, 48, 66, 75, 89, 95} When performing a binary search, the element to be found is first compared with ____.

The type vector provides the expression ____________________, which returns the maximum number of elements that can be inserted into the object vecList.

In the insertion sort function, the variable firstOutOfOrder is initialized to ____, assuming n is the length of the list.

The statement vector<elemType>____________________; creates the vector object vecList of size n.

Which of the following statements declares intList to be an empty vector?

In a bubble sort, the smaller elements move toward the bottom, and the larger elements move toward the top of the list.

The type vector provides the function ____________________, which returns the first element in the vector object.

The size of a list is fixed and cannot be increased or decreased.