Algorithms-CSE221

Programming Language Used:

Merge Sort
Quick Sort
Counting Sort
Bucket Sort
Radix Sort
Key Index Search and Sort
Binary Search
Ternary Search
Jump Search
Interpolation Search (improved variant of binary search)
Graph Representations (Undirected)
BFS and DFS Algorithms
Topological Sort
Minimum Coin Change (Greedy Method)
Dijkstra's Algorithm
Kruskal's Algorithm
Prim's Algorithm
LCS Algorithm
Fractional Knapsack (aka Continuous Knapsack)
0-1 Knapsack Problem
Hamming Distance
Edit Distance Recursive Algorithm (Levensthein Distance if all of the operations are of cost = 1)
Edit Distance Dynamic Programming Algorithm
Run Length Encoding
Huffman Coding
Strassen’s Matrix Multiplication
Matrix Chain Multiplication (Dynamic Programming)
MiniMax Algorithm

Name		Name	Last commit message	Last commit date
0-1 Knapsack.py		0-1 Knapsack.py
BFS and DFS.py		BFS and DFS.py
Bucket Sort.py		Bucket Sort.py
Counting Sort.py		Counting Sort.py
Dijkstra's Algorithm.py		Dijkstra's Algorithm.py
Edit Distance Recursive.py		Edit Distance Recursive.py
Edit Distance.py		Edit Distance.py
Fractional Knapsack.py		Fractional Knapsack.py
Hamming Distance.py		Hamming Distance.py
Interpolation Search.py		Interpolation Search.py
Key Index Search and Sort.py		Key Index Search and Sort.py
Kruskal's Algorithm.py		Kruskal's Algorithm.py
LCS.py		LCS.py
LICENSE		LICENSE
MiniMax Algorithm.py		MiniMax Algorithm.py
Minimal Coin Change (Greedy Method).py		Minimal Coin Change (Greedy Method).py
README.md		README.md
Run Length Encoding.py		Run Length Encoding.py
Undirected Graph Representations.py		Undirected Graph Representations.py