Register

#Prims Algorithm

238 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

329
views
1 answers
0 votes
Mrityudoot asked Mar 7
329 views
Sorting Algorithm
For flag based approach in Bubble sort we can check first by a flag if the list is sorted or not in O(n), and if it is sorted, then no need to sort ... the same concept applicable to selection sort? Why it never comes down from O(n$^2$)?
User Avatar
616
views
1 answers
1 votes
Sajal Mallick asked Nov 28, 2023
616 views
algorithm time complexity madeeasy
Consider the problem that given a set Sof n integers and another integer x, whether or not there exist two elements in S whose sum is exactly x. What is the worst ... in dynamic programming? Then complexity should be O(n^2).How O(n logn)?
User Avatar
219
views
0 answers
0 votes
Sajal Mallick asked Nov 28, 2023
219 views
algorithm time complexity madeeasy ots
What will be the complexity?
User Avatar
237
views
0 answers
0 votes
Sajal Mallick asked Nov 27, 2023
237 views
Algorithm Madeeasy Workbook
As we have to select maximal set of “non overlapping” activities. So like job scheduling algo of greedy we can solve it. So according to that complexity must be O(n logn). But ans is (b). Anyone please explain.
User Avatar
Link Copied!