Q.

What is the running time of the Floyd Warshall Algorithm?

A. big-oh(v)
B. theta(v2)
C. big-oh(ve)
D. theta(v3)
Answer» D. theta(v3)
Explanation: the running time of the floyd warshall algorithm is determined by the triply nested for loops. since each execution of the for loop takes o(1) time, the algorithm runs in time theta(v3).
625
0
Do you find this helpful?
3

View all MCQs in

Design and Analysis of Algorithms

Discussion

No comments yet

Related MCQs