Given below are some famous algorithms and some algorithm design paradigms
|
Algorithms |
Design Paradigms |
|
1. Dijkstra’s shortest path algorithm |
(a) Greedy design |
|
2. Floy-Warshall’s all-pair-shortest path algorithm |
(b) Divide and conquer |
|
3. Kuskal’s algorithm |
(c) Dynamic programming |
|
4. Merge Sort algorithm |
(d) Minimum spanning tree |
1
1 – (a), 2 – (b), 3 – (c), 4 – (c)
2
1 – (c), 2 – (b), 3 – (a), 4 – (b)
3
1 – (a), 2 – (c), 3 – (d), 4 – (b)
4
a – (a), 2 – (b), 3 – (d), 4 – (c)