PA of Algorithms Q88

0. In the following table, the left column contains the names of standard graph algorithms and the right column contains the time complexities of the algorithms. Match each algorithm with its time complexity.
List-I List-II
1. Bellman-Ford algorithm A. O(mlog n)
2. Kruskal's algorithm B. O(n³)
3. Floyd-Warshall algorithm C. O(nm)
4. Topological sorting D. O(n + m)

Answer
Comment
Array

Option : A
Explanation :
Bellman ford = O(n*m)
Kruskal’s Alqo = O(m logn)
Floyd war shall = O(n³)
Topological sort = O(n+m)

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.