Question: Which of the following algorithms uses a priority queue?

Options:

1. Merge Sort
2. Dijkstra\'s Algorithm
3. Binary Search
4. Quick Sort

Correct Answer: Dijkstra\'s Algorithm

Solution:

Dijkstra\'s Algorithm uses a priority queue to efficiently select the next vertex with the smallest tentative distance.