![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
What is running time of Dijkstra’s algorithm using Binary min- heap method? |
A. | o(v) |
B. | o(vlogv) |
C. | o(e) |
D. | o(elogv) |
Answer» D. o(elogv) | |
Explanation: time required to build a binary min heap is o(v). each decrease key operation takes o(logv) and there are still at most e such operations. hence total running time is o(elogv). |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet