Quiz Priority Queue - API and Implementation

All of the examples below are applications that use priority queues - except for one. Which is the example that does not fit? -Huffman Codes -Maintain largest M values in a sequence -Dijkstra's Algorithm -Determining the percolation threshold

Determining the percolation threshold

Prof. Sedgewick introduced two ways to implement priority queues: ordered and unordered arrays. Both of these implementations are simple and straight-forward. However, they have significant drawbacks. Match the drawback described on the left to the implementation on the right too slow during insertion too slow when deleting

ordered array unordered array

Match the description on the left to the data type on the right remove a random item remove the item least recently added remove the item most recently added remove the largest (or smallest) item

randomized queue queue stack priority queue