Computer Science 210
Data Structures
Fall 2016, Siena College
Lecture 32: Heaps and Heapsort
Date: Monday, November 28, 2016
Agenda
- Lab practical exams back, and grade improvement opportunity
- Announcements
- a copy of sample solutions to practice exam is outside my office
- Exam 2 review tomorrow evening
- Exam 2 during labs on Wednesday
- Lab 9: Best Of continues, now due Friday,
12/2
- Lab 8: P.S.: It's Just a Stack recap
- Lecture 31 assignment recap
- Heaps
- Heap-based priority queue
- Heapsort
Lecture 32 Assignment
Due at the start of class, Friday, December 2.
Please submit answers to these questions in
Blackboard under "Lecture 32 Assignment" by the start of
class. We will discuss these questions at the start of class, so no
late submissions can be accepted.
- Bailey Problem 13.12, p. 339 (3 points)
- Complete the heapsort procedure on the example on the array you
just "heapified" in 13.12. (3 points)
Terminology
Examples