#### Algorithms Programs List

Program 2: Implement Heap Sort (The program should report the number of comparisons).

Program 3: Implement Radix Sort.

Program 5: WAP to implement BFS in a graph represented via adjacency list.

Program 6: WAP to implement DFS in a a graph represented via adjacency list.

Program 7: Using any greedy approach find the Minimum Spanning Tree of a graph.

For the algorithms at S.No 1 to 2, test run the algorithm on 100 different inputs of sizes varying from 30 to 1000. Count the number of comparisons and draw the graph. Compare it with a graphs of nlogn, n and n^{2}.