1. CSE 373 Data Structures and Algorithms
Lecture 15: Priority Queues (Heaps) III

2. Generic Collections

3. Generics and arrays
public class Foo<T> {
private T myField; // ok
public void method1(T param) {
myField = new T(); // error
T[] a = new T[10]; // error }
You cannot create objects or arrays of a parameterized type.
Why not?

4. Generics/arrays, fixed
public class Foo<T> {
private T myField; // ok
public void method1(T param) {
myField = param; // ok
T[] a2 = (T[])(new Object[10]); // ok }
But you can declare variables of that type, accept them as parameters, return them, or create arrays by casting Object[].

5. The compareTo method
The standard way for a Java class to define a comparison function for its objects is to define a compareTo method.
Example: in the String class, there is a method:
public int compareTo(String other)
A call of A.compareTo(B) will return:
a value < 0 if A comes "before" B
a value > 0 if A comes "after" B
or 0 if A and B are "equal”

6. Comparable
public interface Comparable<E> {
public int compareTo(E other); }
A class can implement the Comparable interface to define a natural ordering function for its objects.
A call to the compareTo method should return:
a value < 0 if the other object comes "before" this one
a value > 0 if the other object comes "after" this one
or if the other object is considered "equal" to this

7. Comparable template
public class name implements Comparable<name> {
...
public int compareTo(name other) { }
Exercise: Add a compareTo method to the PrintJob class such that PrintJobs are ordered according to their priority (ascending – lower priorities are more important than higher ones).

8. Comparable example
public class PrintJob implements Comparable<PrintJob> {
private String user;
private int number;
private int priority;
public PrintJob(int number, String user, int priority) {
this.number = number;
this.user = user;
this.priority = priority; }
public int compareTo(PrintJob otherJob) {
return priority - otherJob.priority;
public String toString() {
return number + " (" + user + "):" + priority;

9. d-Heaps

10. Generalization: d-Heaps
Each node has d children
Still can be represented by array
Good choices for d are a power of 2
Only because multiplying and dividing by powers of 2 is fast on a computer
How does height compare to binary heap? 4 9 6 5 3 2 1 8 10 12 7 11
D-heaps address all these problems.
Note that will reduce the height of the tree: insert is faster.

11. Operations on d-Heap insert: runtime = remove: runtime =
Does this help insert or remove more?
depth of tree
decreases,
(logd n)
bubbleDown requires more comparisons to find min,
(d logd n) 11

12. Other Priority Queue Operations

13. More Min-Heap Operations
decreasePriority: reduce the priority value of an element in the queue
Solution: change priority and ________________________
increasePriority: increase the priority value of an element in the queue
Solution: change priority and _________________________
How do we find the element in the queue? What about duplicates?
Need a reference to the element!
percolateUp
Why do I insist on a pointer to each item in decreaseKey, increaseKey, and remove?
Because it’s hard to find an item in a heap; it’s easy to delete the minimum, but how would you find some arbitrary element?
This is where the Dictionary ADT and its various implementations which we will study soon come up.
decreaseKey: percolateUp
increaseKey: percolateDown
percolateDown
It’s hard to find in a pQ

14. More Min-Heap Operations
remove: given a reference to an object in the queue, remove the object from the queue
Solution: set priority to negative infinity, percolate up to root and deleteMin
findMax
Solution: Can look at all leaves, but not really the point of a min-heap!
Why do I insist on a pointer to each item in decreaseKey, increaseKey, and remove?
Because it’s hard to find an item in a heap; it’s easy to delete the minimum, but how would you find some arbitrary element?
This is where the Dictionary ADT and its various implementations which we will study soon come up.
buildHeap:
Just call insert N times: N log N worst case, O(n) average case
Can we get guaranteed linear time?
What about build heap? Is that really a necessary operation?
It turns out that the necessity for this is based _purely_ on the fact that we can do it faster than the naïve implementation!
Call insert n times
Θ(n log n) worst,
Θ(n) average

15. Building a Heap Given a list of numbers, how would you build a heap?
At every point, the new item may need to percolate all the way through the heap
Adding the items one at a time is (n log n) in the worst case
A more sophisticated algorithm does it in (n)

16. O(N) buildHeap
First, add all elements arbitrarily maintaining the completeness property
Then fix the heap order property by performing a "bubble down" operation on every node that is not a leaf, starting from the rightmost internal node and working back to the root
Red nodes need to percolate down 6 60 14 18 21 45 32
Let’s try pretending it’s a heap already and just fixing the heap-order property.
The red nodes are the ones that are out of order.
Question: which nodes MIGHT be out of order in any heap?

17. buildHeap practice problem
Each element in the list [12, 5, 11, 3, 10, 6, 9, 4, 8, 1, 7, 2] has been inserted into a heap such that the completeness property has been maintained.
Now, fix the heap's order property by "bubbling down" every internal node. 2 7 1 8 4 9 6 10 3 11 5 12
Red nodes need to percolate down
Let’s try pretending it’s a heap already and just fixing the heap-order property.
The red nodes are the ones that are out of order.
Question: which nodes MIGHT be out of order in any heap?

18. 6 7 1 8 4 9 2 10 3 11 5 12 6 7 10 8 4 9 2 1 3 11 5 12 11 7 10 8 4 9 6 1 3 2 5 12 11 7 10 8 4 9 6 5 3 2 1 12

19. Final State of the Heap - Runtime bounded by sum
of heights of nodes, which
is linear. O(n)
- How many nodes at height 1, and height 2, up to root,
- See text, Thm. 6.1
p. 194 for detailed proof. 1 3 2 4 5 6 9
How long does this take? Well, everything above the fringe might move 1 step.
Everything height 2 or greater might move 2 steps.
Most nodes move only a small number of steps
 the runtime is O(n).
(see text for proof)
Full sum = (I=0 to height) SUM (h-I) * 2^i 12 8 10 7 11

20. Successive inserts (n log n):
Different Heaps
- Runtime bounded by sum
of heights of nodes, which
is linear. O(n)
- How many nodes at height 1, and height 2, up to root,
- See text, Thm. 6.1
p. 194 for detailed proof.
Successive inserts (n log n):
buildHeap (n): 11 7 10 8 12 9 6 4 5 2 3 1 11 7 10 8 12 9 6 5 4 2 3 1
But it doesn't matter because they are both heaps.

21. Heap Sort

22. Heap sort
heap sort: an algorithm to sort an array of N elements by turning the array into a heap, then doing a remove N times
The elements will come out in sorted order!
What is the runtime?
This algorithm is not very space-efficient. Why not?

23. Improved heap sort The heap sort shown requires a second array
We can use a max-heap to implement an improved version of heap sort that needs no extra storage
Useful on low-memory devices
Still only O(n log n) runtime
Elegant

24. Improved heap sort 1 Use an array heap, but with 0 as the root index
max-heap state after buildHeap operation:

25. Improved heap sort 2 State after one remove operation:
Modified remove that moves element to end

26. Improved heap sort 3 State after two remove operations:
Notice that the largest elements are at the end (becoming sorted!)

27. Sorting algorithms review
Best case
Average case (†)
Worst case
Bubble sort n n2
Selection sort
Insertion sort
Mergesort
n log2n
Heapsort
Quicksort
† According to Knuth, the average growth rate of Insertion sort is about 0.9 times that of Selection sort and about 0.4 times that of Bubble Sort. The average growth rate of Quicksort is about 0.74 times that of Mergesort and about 0.5 times that of Heapsort.