Lecture 30

Learning objectives

After this class, you should be able to:

1. Given an array of data, organize them as a heap using the O(n) time algorithm discussed in class.
2. Prove that the heap initialization algorithm discussed in class has time complexity O(n).

Reading assignment

1. Section 6, section 6.3.4.
2. Lecture: Priority queues.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Organize the array: 16 14 10 8 7 9 3 2 4 1 as a min-heap, using the O(n) time algorithm discussed in class. Show all steps.
  2. Derive an expression for ∑k=0∞ k2 xk.
  3. Use integration to derive a bound for ∑k=1∞ k xk.

• Questions on next lecture's material
  1. Is the STL priority_queue by default a min-heap or a max-heap?

---

Last modified: 14 Nov 2011