This repository contains fully solved Design and Analysis of Algorithms (DAA) lab programs in C language, as per the KIIT University 5th semester syllabus.
| Lab | Topic |
|---|---|
| 1 | Arrays, Prefix Sums, Rotations |
| 2 | Recursion, GCD |
| 3 | Merge Sort, Quick Sort |
| 4 | Heap (Min & Max) |
| 5 | Greedy (Knapsack, Huffman) |
| 6 | MST – Prim’s & Kruskal’s |
| 7 | Dijkstra’s Shortest Path |
| 8 | DP – Matrix Chain & LCS |
| 9 | DP – Floyd-Warshall |
| 10 | Randomized Quick Sort, Bit Counters |
- 🧠 Language: C
- 💻 Compilers: GCC / VS Code
- 📁 File I/O used for some programs
- 🧪 Suitable for: Lab submissions, Viva, Semester prep
# Compile using gcc
gcc lab3_merge_sort.c -o merge
./merge🤝 Contributions If you want to improve any solution or add optimizations, feel free to fork and raise a pull request!
🧑💻 Author Ankan GitHub: @CodeWithAnkan
📜 License This repo is free to use under the MIT License. Attribution appreciated 💙