Design and Analysis of Algorithms

This repository contains implementations of fundamental algorithms covered in the Design and Analysis of Algorithms course, crreated as a resource for students.

Overview

Language: Python

The implementations focus on the logic and practical application of standard algorithms across Sorting, Graph Theory, Greedy Methods, and Dynamic Programming.

Contents

1. Sorting

• Insertion Sort
• Selection Sort
• Merge Sort
• Quick Sort
• Heap Sort
• Counting Sort
• Radix Sort

2. Greedy Algorithms & Graph Traversals

• Fractional Knapsack
• Job Scheduling
• Breadth-First Search (BFS)
• Depth-First Search (DFS)
• Prim's Algorithm
• Kruskal's Algorithm
• Dijkstra's Algorithm
• Bellman-Ford Algorithm

3. Dynamic Programming

• Fibonacci Sequence
• Longest Common Subsequence
• Weighted Job Scheduling
• 0/1 Knapsack

How to Run

1. Clone the repository:

   git clone [https://github.com/A-Rahil/DA-Algorithms.git](https://github.com/A-Rahil/DA-Algorithms.git)