To complete this assignment, edit the following constructors and methods:
1. public MaxPQ(Key[] keys) - change the following loop
for (int k = N/2; k >= 1; k--)
sink(k);
2. private void swim(int k)
3. private void sink(int k)
It may also help to write the following helper methods:
4. private int findParent(k) - returns the parent of element k
5. private int findLargestChild(k) - returns the child of k with the largest key.
Math 140 Project 2 Due Date is anytime on Nov 1, 2012
Output for SIZE = 4:
Array values for the heap created with MaxPQ(Keys[] keys)
3, 1, 2, 0
Array values for the heap created with MaxPQ(int capacity)
3, 0, 1, 2
Output for SIZE = 12:
Array values for the heap created with MaxPQ(Keys[] keys)
11, 6, 9, 10, 4, 5, 1, 7, 8, 2, 0, 3
Array values for the heap created with MaxPQ(int capacity)
11, 5, 8, 10, 0, 3, 4, 1, 6, 7, 2, 9
Output for SIZE = 20:
Array values for the heap created with MaxPQ(Keys[] keys)
19, 18, 9, 12, 15, 17, 6, 7, 8, 2, 10, 11, 3, 13, 14, 4, 16, 0, 5, 1
Array values for the heap created with MaxPQ(int capacity)
19, 18, 8, 11, 13, 16, 17, 1, 6, 7, 2, 9, 10, 0, 5, 12, 3, 14, 15, 4