DAA Practice (C++)

A collection of C++ implementations for various algorithms and data structures.

File Structure

• data_structures/: Fundamental implementations of data structures like Binary Search Trees.
• greedy/: Greedy approaches including Fractional Knapsack and Job Sequencing.
• recursion/: Simple recursion problems like Fibonacci and Factorial.
• searching/: Implementations of Linear Search and Binary Search along with their invariant analysis.
• sorting/: Common algorithms including Bubble, Selection, Insertion, Quick, Merge, and Heap Sort. Also contains comparative analysis files.
• string_matching/: String matching techniques including Brute Force and Naive approaches.

How to Run

Use any standard C++ compiler to compile and run the individual .cpp files. Example:

g++ sorting/bubble_sort.cpp -o bubble_sort
./bubble_sort

Purpose

These programs were developed as part of my course assignments and exercises to learn and practice core DAA concepts in C++.