What is the complexity of Kruskal's algorithm for...
Guiding State PSC aspirants since 2016 50,000+ students · 1,000+ final selections Exam Calendar Results Call 9116926003
pscnotes
Pick your state
RPSC Prelims previous year questions

What is the complexity of Kruskal's algorithm for complete graph of n vertices to final minimum cost spanning tree? (if we use min heap data structure)

Asked in RPSC 23Feb 2016Question Paper for VicePrincipal/Superintendent ITI Screening Test 2012(Computer Science)VICE PRINCIPAL/SUPDT. ITI - 2012

  1. Θ(n log n)
  2. Θ(n²)
  3. Θ(n² logn²)
  4. Θ(n)

Answer under review: our editors are checking this question. Try the other RPSC Prelims previous year questions questions meanwhile.

More RPSC Prelims previous year questions questions

All 11,911 RPSC Prelims previous year questions questions →