Heaps and Priority Queues
88 / 170Heaps and Priority QueuesLesson 8 of 8About 50 min
Two problems rebuilt cold, plus the signal that separates a heap from a sort.
You have ten million log entries on disk and need the fifty with the highest severity. Memory is limited. What fits best?
You solved this in Unit 1 with counting buckets. Build it again with a bounded heap and compare the two costs out loud before you start.
You have solved this one before. Rebuild it from scratch without looking at your old submission. If the approach does not come back within a few minutes, that is the signal that it needs another pass.