- A O(N)
- B O(log N)
- C O(N^2)
- D O(E + V log V), where E is the number of edges and V is the number of vertices.
Data Structure Introduction Time Complexity
⚠ Report ✓ Question Verified Copy Link
Q: How is the time complexity of Dijkstra's algorithm for finding the shortest path in a graph characterized?
Time Complexity
Learn More MCQ Questions from Data Structure Introduction Time Complexity