The Gateway to Computer Science Excellence
+3 votes
1.2k views

Explain 

  • Prims Algorithm
  • Analysis Of Time Complexity
  • How does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
in Algorithms by Boss (21.5k points)
retagged by | 1.2k views

1 Answer

0 votes
The no. of edges in a sparse graph can be $(V-1)$ and in dense, it may go up to $O(V^2)$

therefore it wouldn't be incorrect to write$ O(ElogV +VlogV)= O(ElogV)$
by Active (2.8k points)
edited by
+4
if connected :)
0
Oh yes

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,258 answers
198,086 comments
104,735 users