This repository contains the Lab codes of the course Algorithms (CSo-221N) at IIT BHU Varanasi - Odd Semester 2021-22.
Guided By: Dr. Ravi Shankar Singh, Associate Professor, CSE, IIT (BHU) Varanasi.
- Lab 1:Implementation of Iterative and Recursive Quick Sort
- Lab 2:Implementation of Binary Multiplication using Naive Method & Karatsuba algorithm (Divide and Conquer).
- Lab 3:Implementation of Iterative and Recursive Merge Sort
- Lab 4:Implementation of Fast(D&C) and Slow(Naive) Heap
- Lab 5:Convex Hull (Divide and Conquer)
- Lab 6:Finding Second Best Minimum Spanning Tree ( Krushkal Algorithm )
- Lab 7: Fractional Knapscak & Activity Selection
- Lab 8:Chain Matrix Multiplication (Divide and Conquer & DP)
- Lab 9:Graph Edit Distance (A* Algorithm)
- Lab 10: Sum of Subsets (Backtracking) & Travelling Salesman (Branch and Bound)
- Lab 11: Huffman Coding Compression & Decompression (Greedy)
- Slow Heap Lab Assignment 4
- Convex Hull Divide adn Conquer
- Chain Matrix Divide and Conquer
- Graph Distance A*