Register

algorithm

• retagged by
244 views

1 Answer

0 votes
0 votes
In computer science, an algorithm is said to be asymptotically optimal if, roughly speaking, for large inputs it performs at worst a constant factor (independent of the input size) worse than the best possible algorithm.
 Also try...........
Read, learn and practice MCQ and answers with explanation on Current Affairs, GK, Education, Aptitude, Verbal ability & Computer science for interview & Govt. Exams
 http://www.gkindiaonline.com/
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
3
Sajal Mallick asked Nov 28, 2023
185 views
algorithm time complexity madeeasy ots
What will be the complexity?
What will be the complexity?
User Avatar
0 votes
0 votes
0 answers
4
Sajal Mallick asked Nov 27, 2023
183 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.
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 l...
User Avatar
Link Copied!