What is the time complexity of Dijikstra’s algorithm?
A. O(N)
B. O(N3)
C. O(N2)
D. O(logN)
Answer:C
What is the time complexity of Dijikstra’s algorithm?
A. O(N) B. O(N3) C. O(N2) D. O(logN)
Explanation: Time complexity of Dijkstra’s algorithm is O(N2) because of the use of doubly nested for loops. It depends on how the table is manipulated.