Exam 11: Sorting

If the array happens to be sorted before selection sort begins, no exchanges will be required.

A(n) __________ sort compares adjacent array elements and exchanges their values if they are out of order.

The total effort to reconstruct a sorted array through merging is O(__________).

In the best case scenario for insertion sort, the maximum number of comparisons is O(__________).

When comparing selection sort, bubble sort, and insertion sort, we can observe that __________ sort gives the best performance for most arrays, because it takes advantage of any partial sorting that is in the array and uses less costly shifts instead of exchanges to rearrange array elements.

Suppose the growth rate of a sorting routine is O(n log n). If the sorting routine is applied to an array with 1,024 items, we can expect it to perform about __________ operations.

The time and space requirements for a single merge operation are each O(__________)

The merge sort algorithm requires, at least temporarily, n log n extra storage locations.

A max heap is a data structure that maintains the largest value at the top.

The __________ sort is a quadratic sorting algorithm based on the technique used by card players to arrange a hand of cards.

If the pivot used by quicksort is always the first element of an input array, the worst possible performance occurs when the input array is sorted.

The error written into KW::insert function below can be corrected with the code __________.

In the best case scenario of quicksort, the partitioning process at each level involves moving every element into its correct partition, so quicksort is O(__________).

Because we have n items to insert and each insert (or remove) is O(log n), building a heap is O(__________).

The process by which quicksort rearranges an array into two parts around a pivot is called __________.

For a node at position p in a heap, the right child is at __________.

In the worst case scenario, the number of comparisons performed by a bubble sort is O(__________).

__________ is the process of rearranging the data in an array or container so that the data elements are in increasing (or decreasing) order.

If the pivot value generated by quicksort is a random value selected from the current sequence, then statistically it is expected that one-quarter of the items in the sequence will be less than the pivot value and three-quarters will be greater than the pivot value.

In a selection sort, there are at most __________ exchanges.