Algorithms

Select the accurate description of Dijkstra's algorithm.

• A. A graph traversal algorithm that explores all neighbors at the current depth before moving deeper.
• B. A divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.
• C. An algorithm that finds the shortest path between nodes in a graph with non-negative edge weights. ✓
• D. A divide-and-conquer sorting algorithm that partitions elements around a pivot value.