3105 Algorithms

This repository contains a collection of algorithms that were discussed in the course CSI3105: Design & Analysis of algorithm I during Fall 2023. They are implemented using mainly C++. For personal archive only

How to run the code

For every algorithm, there is a piece of code for testing. I've comment-out all of them since it's designed to be mutually exclusive. Pick one you want and un-comment it, then compile and run main.cpp

List of problems and algorithm (more to come):

1. Stable Matching - Gale shapley algorithm
2. Graph - breadth-first-search (BFS) and depth-first-search (DFS), test bipartiteness
3. Directed Graph - test connectivity and find topological order of graph
4. Greedy strategy - Interval scheduling, Interval partitioning and Shortest-path-problem
5. More on Greedy strategy - Minimum spanning tree (MST) problem: two ways (Prim's and Kruskal)
6. Divide-and-Conquer strategy - Mergesort, Counting Inversions, Integer multiplication and matrix multiplication