- Courses
- Tutorials
- Practice
- Contests
Switch to Dark Mode
Algorithms | Greedy Algorithms | Question 5
Last Updated : Jan 13, 2025
Discuss
Comments
Which of the following is true about Kruskal and Prim MST algorithms?
Assume that Prim is implemented for adjacency list representation using Binary Heap and Kruskal is implemented using union by rank.
Worst case time complexity of both algorithms is same.
Worst case time complexity of Kruskal is better than Prim
Worst case time complexity of Prim is better than Kruskal
None of these
This question is part of this quiz :
Top MCQs on Greedy Algorithms with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks