Design and Analysis of Algorithm

---

Laboratory Incharge:
Prof. Amit Tiwari  
Email: amit.comp@srpec.org

Experiments to be Performed:

Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Practicals include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths.

• • Implementation and Time analysis of Bubble Sort
• • Implementation and Time analysis of Insertion Sort.
• • Implementation and Time analysis of Selection Sort.
• • Implementation and Time analysis of Merge Sort.
• • Implementation and Time analysis of Quick Sort.
• • Implementation and Time analysis of Linear and binary Search algorithm.
• • Implementation and Time analysis of Max heap algorithm.
• • Implementation and Time analysis of Factorial program using recursive and iterative method.
• • Implementation and Time analysis of Knapsack Problem (Dynamic Programing) .
• • Implementation and Time analysis of matrix multiplication.
• • Implementation and Time analysis of prims algorithm.