Welcome to my Algorithm Repository, a comprehensive collection of algorithms discussed in class. This repository serves as a valuable resource for understanding, implementing, and experimenting with various algorithms. Some algorithms include Stable Matching, Dijkstra, Interval Partitioning, Interval Scheduling, and Merge and Sort. Each algorithm is organized into its own repository, complete with a detailed README providing insights into its functionality, implementation, and potential applications.
- Stable Matching: The Gale-Shapley Stable Matching Algorithm addresses the Stable Matching Problem, aiming to find a stable matching between two sets of participants based on their preference lists.
- Dijkstra's Algorithm: This classic algorithm efficiently finds the shortest path between nodes in a graph, making it indispensable in network routing and optimization problems.
- Interval Scheduling: This algorithm tackles scheduling tasks within a given time frame to maximize resource utilization, widely applied in job scheduling and project management.
- Interval Partitioning: Interval partitioning algorithm addresses the task of scheduling within a given time frame to minimize resource conflicts.
- Merge and count algorithm provides a solution for counting inversions in an array, essential for sorting and optimization problems.
Each algorithm resides in its own repository, allowing for easy navigation and individual exploration. The main page of this repository serves as a hub, providing quick access to each algorithm's repository through relevant links.
To delve into the details of any specific algorithm, simply click on its corresponding link below: