Register

algorithm

• retagged by
476 views

1 Answer

0 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/
Voting & Accepting an answer helps improve the community
← Previous · regarding syllabusNext → · Test by Bikram | Com...
← Previous in category · Gate Algo & dsNext in category → · Tower of Hanoi
Position:
Show:

Related questions

1 1 vote
1 1 answer
113
113 views
GO Classes asked Aug 29
113 views
GO Classes DPP | GATE CS, DA | Algorithms | Dijkstra's Algorithm
Consider Dijkstra's algorithm on a graph having $V$ vertices and $E$ edges.Suppose an indexed priority queue is not used.Instead, the tentative distances are stored only ...
0 0 votes
2 2 answers
937
937 views
Vishal_Huneria asked Dec 28, 2025
937 views
Dijkstra’s algorithm on directed graph with negative edges – expected output?
0 0 votes
1 1 answer
468
468 views
Neeraj_patel asked Nov 14, 2024
468 views
Dijkstra Algorithm
What is the Time Complexity of the Dijkstra when it is using Adjacency list + Array (sorted or unsorted ) ? If it is O( V^2 + E ) then ,According to the General form of A...
0 0 votes
1 answers 1 answer
892
892 views
Mrityudoot asked Mar 7, 2024
892 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 and the operation ends...