← Quiz: Minimum Spanning Trees: all 10 questions
Quiz: Minimum Spanning Trees · Question 9 of 10
What is the time complexity of Kruskal's algorithm?
What is the time complexity of Kruskal's algorithm?
- A.O(V + E)
- B.O(V²)
- C.O(V · E)
- D.O(E log E)
Answer & explanation
Correct answer: O(E log E)
Sorting the edges dominates; the Union-Find operations are nearly constant each.
Can you get the rest right without peeking?
Take the timed Quiz: Minimum Spanning Trees quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →