|
|
Computer Science 211
Data Structures
Mount Holyoke College
Fall 2009
|
|
Lecture 25: Heaps and Heapsort
Date: Wednesday, November 11, 2009
- Announcements
- Upcoming exam
- Review on Friday.
- Exam on Monday.
- Details on Lecture 24 page.
- Lecture Assignment Recap
- Heaps
- Heap-based priority queue
- Heapsort
- structure5.VectorHeap
- SortingComparisons/HeapSort.java
- structure5.SkewHeap
Due at the start of class, Wednesday, November 18. (After the exam!)
Turn in short answers to these questions. Please turn in a hard
copy (typeset or handwritten are OK). We will discuss these problems
during class, so no late submissions are accepted.
- Bailey Problem 13.2, p. 338.
- Bailey Problem 13.12, p. 339.
