Algorithms | Greedy Algorithms | Question 1

Which of the following standard algorithms is not a Greedy algorithm?
(A) Dijkstra’s shortest path algorithm
(B) Prim’s algorithm
(C) Kruskal algorithm
(D) Huffman Coding
(E) Bellmen Ford Shortest path algorithm


Answer: (E)

Explanation: See https://www.geeksforgeeks.org/greedy-algorithms-set-1-activity-selection-problem/ and https://www.geeksforgeeks.org/dynamic-programming-set-23-bellman-ford-algorithm/



My Personal Notes arrow_drop_up

Recommended Posts:



0 Average Difficulty : 0/5.0
No votes yet.






User Actions