Algorithm Library made in the course Algorithm Analysis and Design under Prof. Srinathan Kannan
Master Theorem, Merge Sort, Strassen's Matrix Multiplication, Median of Medians, Fast Fourier Transform
Prim's Algorithm, Kruskal Algorithm, Path Compression, Huffman coding, Set Cover Problem
nth Fibonacci, Karatsuba Algorithm
Shortest Path in DAG, Longest Increasing Subsequence, Edit Distance, Chain Matrix Multiplication, Knapsack, Shortest Reliable Path, Floyd Warshall Algorithm, Independent Set in Trees
Algorithms included: Euclid's GCD Algorithm, Euclid's Extended Algorithm, Modular Division, Miller Rabin Randomised Primality Testing
Small Description about NP, P, NP-complete and NP-Hard problems