Exam 8: Sorting

A class that implements the Comparable interface must define a(n) ____________________ method that determines the natural ordering of its objects.

You can think of the ____________________ sort as a divide-and-conquer approach to insertion sort.

Insertion sort is considered a quadratic sort.

The following represents the ____ sort algorithm. Set the initial value of gap to n / 2. While gap > 0 For each array element from position gap to the last element Insert this element where it belongs in its subarray. If gap is 2, set it to 1. Else gap = gap/2.2.

Which of the following generally gives the worst performance?

Which of the following sorts is not O(n lg(n))

____________________ sorts an array by making several passes through the array, selecting the next smallest item each time and placing it where it belongs in the array.

Whenever a recursive method is called, a copy of the local variables is saved on the run-time ____________________.

____________________ sort has O(n^3/2) or better performance.

The idea behind ____________________ sort is to sort many smaller subarrays using insertion sort before sorting the entire array.

In the best case, selection sort makes O(______) comparisons.

The following is the ____ algorithm. Build a heap by rearranging the elements in an unsorted array. While the heap is not empty Remove the first item from the heap by swapping it with the last item in the heap And restoring the heap property.

The following represents the algorithm for ____ sort. For each array element from the second (nextPos = 1) to the last Insert the element at nextPos where it belongs in the array, increasing The length of the sorted subarray by 1 element.

With respect to merge sort, additional space usage is O(___________________).

The following is the ____ algorithm. Access the first item from both sequences. While not finished with either sequence Compare the current items from the two sequences, copy the smaller current item to the output sequence, and Access the next item from the input sequence whose item was copied Copy any remaining items from the first sequence to the output sequence. Copy any remaining items from the second sequence to the output sequence.

The following is the ____ algorithm For fill = 0 to n - 2 do Set posMin to the subscript of the smallest item starting at subscript fill. Exchange the item at posMin with the one at fill.

Shell sort is ____ if successive powers of 2 are used for gap.

The Java API ____________________ provides a class Arrays with several overloaded sort methods for different array types.

With respect to selection sort, the number of comparisons is O(n).

The number of comparisons for a selection sort is represented by the series: (n - 1) + (n - 2) + ... + 3 + 2 + 1