Exam 18: Searching and Sorting Algorithms

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

Let f be a function of n.By the term ____________________,we mean the study of the function f as n becomes larger and larger without bound.

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

Let f and g be real-valued functions. Assume that f and g are nonnegative, that is, for all real numbers and We say that is of g(n). written if there exist positive constants c and such that For all

A sequential search of an n-element list takes ____ key comparisons on average to determine whether the search item is in the list.

If a list of eight elements is sorted using selection sort,the unsorted list is ____ after the second iteration.

A sequential search of an n-element list takes ____ key comparisons if the item is not in the list.

The quick sort algorithm uses the ____________________ technique to sort a list.

The ____________________ search algorithm is the optimal worst-case algorithm for solving search problems by using the comparison method.

The behavior of merge sort is ____ in the worst case and ____ in the average case.

The top node of a comparison tree is call the ____________________ node.

When working with the unsorted portion of a list,the second step in a selection sort is to ____.

For a list of length n,the bubble sort makes exactly ____________________ key comparisons.

The behavior of quick sort is ____ in the worst case and ____ in the average case.

For a list of length n,insertion sort makes ____ key comparisons,in the worst case.

During the sorting phase of insertion sort,the array containing the list is divided into two sublists,sorted and unsorted.

When moving array values for insertion sort,to move list[4] into list[2],first ____.

Which of the following correctly states the quick sort algorithm?

Suppose that L is a sorted list of size 1024,and we want to determine whether an item x is in L.From the binary search algorithm,it follows that every iteration of the while loop cuts the size of the search list by half.

Consider the following list: int list[] = {4,8,19,25,34,39,45,48,66,75,89,95} When performing a binary search for 75,after the first comparison,the search is restricted to ____.