Outline:

1. Questions?
2. Heapsort
3. Priority Queue ADT
4. Review for Friday

What’s next

• Assignments 4 and 5 will be finalized Monday at 10pm
• Assignment 6 resubmissions will be due next Friday at 10pm
• Assignment 7 will be released soon, and is all about sorting!

What you should do now:

• Finish Assignment 6
• Review

Reminder: Exam Day on Friday

You will see these Quiz Learning Objectives for the first time:

• QS 1: quicksort
• QS 2: quicksort time complexity
• HP 1: heap ADT
• HP 2: heapsort time complexity

There will also be a packet of learning objectives you’ve seen before, covering everything from Units 1–4 except TR 3.

Reading assignment (to be completed by the next class):

Priority queues and heapsort (from today):

• Heapsort
• Priority queue

Graphs and BFS (for next Monday):

• Graphs
• Adjacency lists
• Breadth-first search