Exam 10: Sorting Algorithms

We use ____ to implement mergesort.

In a ____ queue, customers or jobs with higher priorities are pushed to the front of the queue.

Mergesort uses the divide-and-conquer technique to sort a list.

Insertion sort cannot be applied to linked lists.

In mergesort, all the comparisons are made in the method____, which merges two sorted sublists.

A ____ is a list in which each element contains a key, such that the key in the element at position k in the list is at least as large as the key in the element at position 2k + 1 (if it exists) and 2k + 2 (if it exists).

Selection sort involves the following steps in the unsorted portion of the list: find the location of the smallest element and move the smallest element to the beginning of the unsorted list.

To divide the list into two sublists, we need to find the ____ node of the list.

In a(n) ____, a list is sorted by selecting elements in the list, one at a time, and moving them to their proper positions.

In a selection sort, the first step we locate the smallest item in the entire list, the second step we locate the smallest item in the list starting from the second element in the list, and so on.

When sorting a list, the smallest item must be moved to position 0.

In a heap, the ____ is the largest element of the tree

To ensure that the largest element of the priority queue is always the first element of the queue, we can implement priority queues as ____.

Once the sublists are sorted, the next step in mergesort is to merge the sorted sublists.

A sequential search assumes that the data is in a particular order.

In quicksort, all the sorting work is done in ____ the list.

Initially, in a selection sort we consider that the entire list is unsorted.

In heapsort, after we convert the array into a heap, the ____ phase begins.

Inserting the new element in the first available position in the list ensures that the array holding the list is a complete ____.

In a selection sort, we find the largest item in the list first.