Exam 18: Searching and Sorting Algorithms

To construct a search algorithm of the order less than log₂n,it cannot be ____________________ based.

In the bubble sort algorithm,the following code accomplishes swapping values in elements at positions index and index + 1.

The swap function of quick sort is written differently from the swap function for selection sort.

The binary search algorithm can be written iteratively or recursively.

Assume that list consists of the following elements.What is the result after bubble sort completes? int list[] = {2,56,34,25,73,46,89,10,5,16};

Assuming the following list declaration,which element is at the position 0 after the first iteration of selection sort? int list[] = {16,30,24,7,62,45,5,55}

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

The following C++ function implements the ____________________ sort algorithm. template <class elemType> void Sort(elemType list[],int length) { $\quad$ for (int iteration = 1; iteration < length; iteration++) $\quad$ { $\quad$$\quad$ for (int index = 0; index < length - iteration; index++) $\quad$$\quad$ { $\quad$$\quad$$\quad$ if (list[index] > list[index + 1]) $\quad$$\quad$$\quad$ { $\quad$$\quad$$\quad$$\quad$ elemType temp = list[index]; $\quad$$\quad$$\quad$$\quad$ list[index] = list[index + 1]; $\quad$$\quad$$\quad$$\quad$ list[index + 1] = temp; $\quad$$\quad$$\quad$$\quad$ } $\quad$$\quad$$\quad$ } $\quad$$\quad$ } }

In a binary search,first,the search item is compared with the last element of the list.

In general,the selection sort algorithm is good only for small lists because ____________________ grows rapidly as n grows.