🚀 Design and Analysis of Algorithms (DAA)

Welcome to my Design and Analysis of Algorithms (DAA) repository.

This repository contains C implementations of various algorithms covered in the DAA curriculum. It serves as a collection of algorithm implementations for learning, practice, and academic reference.

📚 Topics Covered

🔍 String Algorithms

• Naive String Matching
• Rabin-Karp Algorithm

⚔️ Divide and Conquer

• Merge Sort
• Quick Sort
• Strassen's Matrix Multiplication
• Convex Hull

🎯 Greedy Algorithms

• Job Sequencing with Deadlines
• Fractional Knapsack
• Minimum Spanning Tree Algorithms
• Huffman Coding
• Single Source Shortest Path

🧩 Dynamic Programming

• Optimal Binary Search Tree (OBST)
• 0/1 Knapsack
• Traveling Salesperson Problem (TSP)

🌐 Network Flow Algorithms

• Ford-Fulkerson Algorithm

🔄 Backtracking

• Eight Queens Problem
• Sum of Subsets Problem
• Graph Coloring
• Knapsack Problem

🌳 Branch and Bound

• 0/1 Knapsack Problem
• Traveling Salesperson Problem (TSP)

💻 Programming Language

• C

🎯 Purpose

This repository is maintained to:

• Practice algorithm implementation
• Understand different algorithm design techniques
• Improve problem-solving skills
• Serve as a quick reference for DAA concepts

👨‍💻 Author

Ramasai88

---

⭐ Feel free to explore the implementations and use them for learning and reference.