1.

What is the time complexity of Dijikstra s algorithm?

A. O(N)
B. O(N<sup>3</sup>)
C. O(N<sup>2</sup>)
D. O(logN)
Answer» D. O(logN)


Discussion

No Comment Found