AOAcodes

Experiment List

1. Insertion and Selection sort and their time complexity
2. Merge and Quick sort and their time complexity
3. Single Source Shortest Path (SSSP) using Dynamic approach - Bellman Ford's Algorithm
4. Longest Common Subsequence
5. Minimum spanning tree - prim's and kruskal's algorithm
6. Single Source Shortest Path (SSSP) using Greedy approach - Djikstra's Algorithm
7. N-Queens problem using backtracking