Algorithms-Collection-Python

Whenever I face an interesting problem I document the algorithm that I learned to solve it. Hopefully my list will increase as time goes on.

Dynamic Programming

• Knapsack 0/1 - Naive recursive implementation
• Knapsack 0/1 - Recursive with memoization implementation

Graph theory

• Bellman-Ford Shortest Path - Unoptimized implementation
• Dijkstra Shortest Path - Naive implementation
• Dijkstra Shortest Path - Heap implementation
• Karger's Minimum cut
• Prim's Algorithm - Naive implementation
• Prim's Algorithm - Heap implementation
• Kruskal's Algorithm - Naive implementation
• Kruskal's Algorithm - Union Find implementation
• Breadth First Search - Queue Implementation
• Depth First Search - Stack Implementation
• Depth First Search - Recursive Implementation

Mathematics

• Karatsuba Multiplication
• Euclidean Algorithm
• Sieve of Eratosthenes

Other

• Maintaining Median
• Huffman Algorithm

Sorting algorithms

• Bubble sort
• Insertion sort
• Selection sort
• Merge sort
• Quick sort

Contributing

I appreciate feedback on potential improvements and/or if you see an error that I've made!