Exam 18: Searching and Sorting Algorithms

After the second iteration of bubble sort for a list of length n,the last ____ elements are sorted.

In the average case,sequential search typically searches ____.

The sequential search algorithm does not require that the list be sorted.

A comparison tree is a(n)____________________ tree.

During the second iteration of a selection sort,the smallest item is moved to the top of the list.

Any sorting algorithm that sorts a list of n distinct elements by comparison of the keys only,in its worst case,makes at least ____________________ key comparisons.

If n = 1000,then to sort the list,selection sort makes about 50,000 key comparisons.

For a list of length n,selection sort makes ____ item assignments.

In a quick sort,all of the sorting work is done by the function ____________________.

The first step in the quick sort partition algorithm is to determine the ____________________ and swap it with the first element in the list.

The formula to find the index of the middle element of a list is ____.

____ sort requires knowing where the middle element of the list is.

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

In a bubble sort for list of length n,the first step is to compare elements ____.

The sequential search algorithm uses a(n)____ variable to track whether the item is found.

If n = 1000,to sort the list,bubble sort makes about ____ item assignments.

The selection sort algorithm finds the location of the smallest element in the unsorted portion of the list.

In the case of an unsuccessful search,it can be shown that for a list of length n,a binary search makes approximately ____________________ key comparisons.

We can trace the execution of a comparison-based algorithm by using a graph called a ____.

A sequence of branches in a comparison tree is called a(n)____________________.