Advanced DSA & Algorithms Lab

A professional and optimized collection of classic data structures and algorithms developed in standard C++.

---

Project Overview

This repository contains a well-structured set of foundational and advanced algorithms implemented with clean architecture, Doxygen-style documentation, and robustness in mind.

---

List of Algorithms & Complexities

Algorithm / Problem	Approach	Time Complexity	Space Complexity
Dijkstra's Shortest Path	Min-Heap / Greedy	$O((V + E) \log V)$	$O(V + E)$
0/1 Knapsack	Dynamic Programming (Bottom-Up)	$O(n \times W)$	$O(W)$ or $O(n \times W)$

---

How to Compile and Run

You can build and run this project using either g++ (direct compilation) or CMake.

Method 1: Using g++ (Direct Compilation)

Open your terminal in the root directory of the project and run:

`bash g++ -std=c++17 main.cpp src/graph.cpp src/dp_algorithms.cpp src/greedy.cpp -Iinclude -o AdvancedDSALab

To run the executable:

• Linux / macOS: ./AdvancedDSALab
• Windows: AdvancedDSALab.exe Method 2: Using CMake (Recommended)

1. Create a build directory

mkdir build cd build

2. Configure the project with CMake

cmake ..

3. Build the project

cmake --build .

4. Run the executable

(Depending on your OS and generator, look inside the build or Debug folder)