UGC-NET | UGC NET CS 2017 Jan – III | Question 35
Dijkstra’s algorithm is based on
(A) Divide and conquer paradigm
(B) Dynamic programming
(C) Greedy Approach
(D) Backtracking paradigm
Dijkstra’s algorithm is based on Greedy Approach.
For more information Refer:Greedy Algorithms | Set 7 (Dijkstra’s shortest path algorithm)
Option (C) is correct.
Quiz of this Question