Exam 10: Sorting Algorithms

Assuming the priority queue is implemented as a heap, the first step is to insert the new element in the ____ available position in the list.

A sorting algorithm makes key comparisons and also moves the data.

Quicksort first selects an element in the list, called the ____, and then partitions the list so that the elements in one sublist are less than pivot.

In the mergesort presented in this chapter, every time we move a node to the merged list, we advance either first1 or first2 to the previous node.

When converting the subtree into a heap, if the root node of the subtree is larger than the larger child, we swap the root node with the larger child.

On average, quicksort is of the order ____.

In quicksort, the list is partitioned in such a way that combining the sorted lowerSublist and upperSublist is trivial.