Design and Analysis of Algorithms

1. Greedy Algorithms
Created by
Dr. Soham Sarkar
ECE dept., RCCIIT

13. Minimum Spanning Tree

14. Prim’s Algorithm

18. Kruskal’s Algorithm

21. Hence, with an efficient sorting algorithm, the time efficiency of Kruskal’s
algorithm will be in O(|E| log |E|).

26. Dijkstra’s Algorithm
This algorithm is applicable to undirected and directed graphs with nonnegative
weights only