CMSC 451 Homework 3
1. Shown below is the code for the insertion sort consisting of two recursive methods that replace the two nested loops that would be used in its iterative counterpart:
void insertionSort(int array)
void insert(int array, int i)
if (i < array.length)
int value = array[i];
int j = shift(array, value, i); array[j] = value;
insert(array, i + 1);
int shift(int array, int value, int i)
int insert = i;
if (i > 0 && array[i – 1] > value)
array[i] = array[i – 1];
insert = shift(array, value, i – 1);
Draw the recursion tree for insertionSort when it is called for an array of length 5 with data that represents the worst case. Show the activations of insertionSort, insert and shift in the tree. Explain how the recursion tree would be different in the best case.
2. Refer back to the recursion tree you provided in the previous problem. Determine a formula that counts the numbers of nodes in that tree. What is Big- for execution time? Determine a formula that expresses the height of the tree. What is the Big- for memory?
3. Provide a generic Java class named SortedPriorityQueue that implements a priority queue using a sorted list implemented with the Java ArrayList class. Make the implementation as efficient as possible.
4. Consider the following sorting algorithm that uses the class you wrote in the previous problem:
void sort(int array)
SortedPriorityQueue<Integer> queue = new SortedPriorityQueue(); for (int i = 0; i < array.length; i++)
for (int i = 0; i < array.length; i++) array[i] = queue.remove();
Analyze its execution time efficiency in the worst case. In your analysis you may ignore the possibility that the array list may overflow and need to be copied to a larger array.