Various list sorting and graph searching algorithms. I do this for fun, so expect these algorithms to grow as I find new challenges.
- Merge Sort
- Quick Sort
- Minimum Cut (Karger)
- Returns the minimum number of cuts in a connected graph
- Strongly Connected Components (Tarjan and Kosaraju)
- Two similar methods (but Tarjan is slightly more efficient) for finding all the strongly connected components in a graph
- Implementation of stack from scratch using Python (not yet implemented)