Algorithms | Analysis of Algorithms | Question 12

Last Updated :
Discuss
Comments

What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices?

O(n2log(n))

Theta(n2log(n))

Theta(n4)

Theta(n3)

This question is part of this quiz :

Top MCQs on Complexity Analysis of Algorithms with Answers,Top 50 Algorithms MCQs with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy