Heap / Priority Queue / Greedy Selection
These visualizers focus on ranked frontier management: which value, project, pair, or half of the stream deserves to stay at the top of a priority queue right now.
Trace the Find K Pairs with Smallest Sums algorithm from parsed input through each decision point.
Trace the Find Median from Data Stream algorithm from parsed input through each decision point.
Trace the IPO algorithm from parsed input through each decision point.
Trace the Kth Largest Element in an Array algorithm from parsed input through each decision point.