Register

doubt algo 2

• edited by
413 views
1 votes
1 votes

• edited by
User Avatar

1 Answer

0 votes
0 votes
using greedy approach we can solve in O(nlogn). ie. by using Kruskal's algo
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
rahul sharma 5 asked Dec 7, 2017
567 views
Algo:- Test series
Consider the following code: Which of the following represents the number of additions performed by above code?
Consider the following code:Which of the following represents the number of additions performed by above code?
User Avatar
0 votes
0 votes
2 answers
2
mehul vaidya asked Aug 16, 2018
411 views
doubt in logarithm
can you please explain how 1-(1/2)^ln(n) becomes (n-1)/n ?
can you please explain how 1-(1/2)^ln(n) becomes (n-1)/n ?
User Avatar
0 votes
0 votes
1 answer
3
Arnabi asked Jan 28, 2017
278 views
Algorithms doubt
User Avatar
0 votes
0 votes
2 answers
4
junaid ahmad asked Dec 24, 2017
379 views
Algo-test
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n). Then [f (n) . g(n)] + h(n) is : a) Ο(n) b)θ(n) I think it must be 0(n)
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n).Then [f (n) . g(n)] + h(n) is : a) Ο(n) b)θ(n)I think it must be 0(n)
User Avatar
Link Copied!