Design and Analysis of Algorithms Lab

1. Analyze Selection Sort Algorithm on different input of size, using random function to generate input sequence

2. Analyze Merge Sort Algorithm on different input of size, using random function to generate input sequence

3. Analyse Linear Search and Binary Search Algorithm on different input sizes.

4. Implement Dijkstra Algorithm to find shortest paths to other vertices.

5. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal’s algorithm and analyse it’s complexity.

6. Implement the All pair shortest path Algorithm using dynamic programming and analyze its complexity

7. Implement the 4-queens problem using backtracking technique and analyse its complexity.