edited by
322 views
1 votes
1 votes
Time complexity of Prim's algorithm for computing minimum cost spanning tree for a complete graph with n vertices and e edges using Heap data structure is-

1. (n+e)*log^2n

2. n^2

3. n^2*logn

4. n*logn
edited by

Please log in or register to answer this question.

Related questions

3 votes
3 votes
0 answers
1
1 votes
1 votes
1 answer
2
KISHALAY DAS asked Dec 25, 2016
699 views
Determine the time complexity of the program segment given below:k = n; while ( k 0) { i = 1; for(j = 1; j <= n; j+=i) i++; k/=2; }$\Theta\left(n^2\right)$$\Theta(n \log...
0 votes
0 votes
2 answers
3
1 votes
1 votes
2 answers
4
akankshadewangan24 asked Sep 20, 2018
841 views
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true?S(n)=O(t(n)) correct H...