CSCI2100 · Method · Chapter 3 · Priority queues
Sift-down
3 steps of prerequisites below it
Sift-down at i repeatedly compares the key with its smaller child and swaps them while the key is larger, moving the possible violation one level down each time.
Taught in
- 3.2 Building a min-heap from the bottom up · introduced
Builds on
- Almost-heap at an index · used in an argument or worked solution, passage 3.2
Used by
Everything this builds on, earliest first · 3 steps
Each step comes after its own prerequisites, so reading in this order never needs something you have not met. It is a reading order for these notes, not a diagnosis of what you know.
- Min-priority queue · 3.1
- Binary min-heap · 3.1
- Almost-heap at an index · 3.2
Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.
Longest chain down to a starting point
Each step is used by the one above it, across courses where the notes link them. It ends at a point the notes define without another point.