This is a simple project with a collection of different algorithms in Python. I learned most of these algorithms through coursework at UC Riverside and implemented them here for practice.
- Merge Sort
- Recursive Multiplication
- Karatusba Multiplication (Divide & Conquer)
- Flood Fill
- Kruskal's Algorithm
- Disjoint Set Structure
- Depth First Search
- Check if Path Exists
- Dijkstra's Shortest Path
- Total Distance and Path Tracing
- Sum using Dynamic Parallelization
- Divide & Conquer Approach (Recursive)
- Sum using Chunking
- Chunk size based on Available Processors