×

Multiple-Choice Questions

The time complexity of Kruskal’s algorithm is ____.

13. The time complexity of Kruskal’s algorithm is ____.

  1. O (E log E)
  2. O (V log V)
  3. O (VE)
  4. None of the above

Answer

The correct answer is: A) O (E log E)

Explanation

The time complexity of Kruskal’s algorithm is O (E log E) , where E stands for edges.

Comments and Discussions!

Load comments ↻






Copyright © 2024 www.includehelp.com. All rights reserved.