TGPSC HMWSSB Manager 2015 Paper 2 CSE · Question 50
Question 50 of the TSPSC Manager (Engineering), HMWSSB, 2015: Paper 2 (Computer Science & Information Technology) (1 November 2015). Try it first, then open the answer. The explanation is in the practice app with the All-in-One Pass.
What is the time complexity of Kruskal's algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges?
- O(n)
- O(m + n)
- O(n²)
- O(m log n)
Show answer
Answer: (4) O(m log n)
Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.