https://github.com/mvharsh/design-and-analysis-of-algorithms
A curated collection of classic algorithm implementations with clear structure, covering dynamic programming, greedy, graph, and divide & conquer techniques.
https://github.com/mvharsh/design-and-analysis-of-algorithms
design-and-analysis-of-algorithms dynamic-programming greedy-algorithm
Last synced: 5 days ago
JSON representation
A curated collection of classic algorithm implementations with clear structure, covering dynamic programming, greedy, graph, and divide & conquer techniques.
- Host: GitHub
- URL: https://github.com/mvharsh/design-and-analysis-of-algorithms
- Owner: mvharsh
- Created: 2025-04-30T09:41:20.000Z (about 2 months ago)
- Default Branch: main
- Last Pushed: 2025-04-30T10:54:27.000Z (about 2 months ago)
- Last Synced: 2025-05-18T20:09:47.757Z (about 1 month ago)
- Topics: design-and-analysis-of-algorithms, dynamic-programming, greedy-algorithm
- Language: C++
- Homepage: https://github.com/mvharsh/Design-and-Analysis-of-Algorithms/
- Size: 54.7 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# 🧠 Design and Analysis of Algorithms
This collection includes classic and fundamental algorithms implemented in C++, organized by their category or strategy (e.g., greedy, dynamic programming, divide & conquer, graph algorithms).
---
## 📂 Repository Structure
Each folder contains:
- ✅ **Code implementation**
- 📘 **README** explaining the time complexity, space complexity and use cases
---
## 📌 List of Implemented Algorithms
### 🔁 Recursion & Dynamic Programming
- [✔️ 0/1 Knapsack Problem](./0%201%20Knapsack%20Problem%20using%20Dynamic%20Programming/)
- [✔️ Matrix Chain Multiplication](./Matrix%20Chain%20Multiplication%20using%20Dynamic%20Programming/)
- [✔️ Recursion and Iteration](./Recursion%20and%20Iteration/)
- [✔️ Recurrence using Master's Theorem](./Recurrence%20using%20Master's%20Theorem/)
### ⚡ Greedy Algorithms
- [✔️ Job Scheduling Problem](./Job%20Scheduling%20with%20Greedy%20Algorithm/)
- [✔️ Traveling Salesman Problem](./Traveling%20Salesman%20Problem%20using%20Greedy%20Approach/)
### 📐 Divide and Conquer
- [✔️ Merge Sort O(n log n)](./Analysis%20of%20Algorithm/)
### 🌐 Graph Algorithms
- [✔️ BFS and DFS](./BFS%20and%20DFS%20in%20an%20Undirected%20Graph/)
- [✔️ Kruskal's Algorithm](./Kruskal's%20Algorithm/)
- [✔️ Prim's Algorithm](./Prim's%20Algorithm/)
### 🧩 String Matching
- [✔️ Naive String Matching Algorithm](./Naive's%20String%20Matching%20Algorithm/)
### 🌲 Tree Algorithms
- [✔️ Tree Traversal (Inorder, Preorder, Postorder)](./Tree%20Traversal/)
### 🔍 Logic and Theory
- [✔️ Logical Equivalence](./Logical%20Equivalence/)
---
## 🚀 How to Use
1. Clone the repo:
```bash
git clone https://github.com/mvharsh/Design-and-Analysis-of-Algorithms.git