PA of Algorithms Q88
88In 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(n3) |
| 3. | Floyd-Warshall algorithm | C. | O(nm) |
| 4. | Topological sorting | D. | O(n + m) |
- Option : A
- Explanation : Bellman ford = O(n*m) Kruskal’s Alqo = O(m logn) Floyd war shall = O(n3) Topological sort = O(n+m)
Accessibility
Oversized Widget
Saved in this browser. Nothing changes for anyone else.