Multiple projects regarding to Design and Analysis of Algorithms course
Designing and implementation of:
- The Closest Pair of Points Problem (Divide & Conquer)
- Convex Hull (Divide & Conquer)
- Sudoku Solver (Backtracking)
- Tournament Scheduler (Divide & Conquer)
- Huffman Coding (Greedy)
- Bellman–Ford (Dynamic Programming)
- Matrix Chain Multiplication (Dynamic Programming)
- N-Queens Solver (Backtracking)
- Travelling Salesman Problem (Dynamic Programming)
