Algorithms

---

• Integer Multiplication and Karatsuba Multiplication
• Bubble Sort, Merge Sort, Quick Sort
• Strassen's Subcubic Matrix Multiplication Algorithm
• Randomized Selection and Deterministic Selection
• Graph and Minimum Cuts
• Graph BFS and DFS
• Strongly Connected Components
• Dijkstra's Algorithm and heaps
• Heaps Operations, Binary Search Tree Operations
• Hash Tables Implementation
• Minimum Spanning Trees PRIM and Kruskai, Clustering

References

---

1. Union-Find Algorithms
2. Heap implementation in Python
3. Python Collections Module
4. Heap queue algorithm
5. Data Structures
6. DataCamp Python Sets and Set Theory
7. How to Stand Out in a Python Coding Interview
8. Deque