Exam 10: Sorting Algorithms

If the list is stored in a linked list, we can traverse the list in only one direction starting at the first node because the links are only in one direction.

In a heap, the ____ element of the list is always the first element of the list.

In the average case of quicksort, the number of key comparisons is ____.

Assuming a priority queue is implemented as a stack, to remove the first element of the priority queue, we copy the last element of the list into the first array position, reduce the length of the list by 1, and restore the heap in the list.

Mergesort and quicksort are similar in how they partition the list.

The modified insertion sort introduced in 1959 by D. E. Shell is known as the diminishing return sort.

____ sort sorts the list by moving each element to its proper place.

The____ for array-based lists is of order O(n log2n) even in the worst case, therefore overcoming the worst case of the quicksort.

A binary search is very fast for array-based lists.

In ____, the elements of the list are viewed as sublists at a particular distance.

In heapsort, only the elements at position 2k + 1 are accessed frequently.

In C++, the array index starts at 0.

If the list is stored in an array, we can traverse the list in either direction using an ____.

Sorted sublists are merged into a sorted list by comparing the elements of the sublists, and then adjusting the references of the nodes with the smaller info.

In mergesort, most of the sorting work is done in ____.

After inserting the new element in the heap, the list might no longer be a heap.

The first step in the heapsort of this chapter is to convert the list into a heap, called ____.

With selection sort, we can keep track of the unsorted portion of the list and repeat the steps involved with sorting with the help of a ____ loop.

When inserting an element in the priority queue, restoring the heap might result in moving the new entry to the root node.

A(n) ____ finds the location of the smallest element in the unsorted portion of the list and moves it to the top of the unsorted portion of the list.