Welcome to my GitHub repository for advanced algorithms, designed specifically for MCA students at DYP International University! In this repository, you'll find implementations of various algorithms, including sorting, graph algorithms, dynamic programming, and more.
Here are the algorithms currently available in this repository:
🚀 Quick sort
🧩 Merge sort
🌲 Prim's algorithm
🧮 Matrix Multiplication
👸 N-Queen problem
🎨 Graph coloring
🏗️ Tower of Hanoi
🎒 Knapsack problem
🚚 Traveling salesman problem
Each algorithm has its own directory, containing a Python implementation, a sample input file, and a README with usage instructions and explanation of the algorithm.
To use these algorithms, simply clone this repository to your local machine, navigate to the directory of the algorithm you want to use, and run the Python file with the provided input file. The README in each directory will provide more detailed instructions.
I welcome contributions to this repository! If you'd like to add an algorithm, improve an existing implementation, or fix a bug, feel free to submit a pull request. Please follow the contribution guidelines in CONTRIBUTING.md.
If you'd like to learn more about algorithms, here are some resources to get you started:
Algorithms, Part I and Algorithms, Part II on Coursera by Robert Sedgewick and Kevin Wayne.
Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
GeeksforGeeks for algorithm explanations, examples, and practice problems.