Algorithms

This repository serves as a collection of notes, code implementations, explanations, and learning resources gathered while studying topics in Algorithms and Data Structures.

It is organized by topic and includes both theoretical concepts and practical code.

Topics Covered (Mid-Term)

Sorting Algorithms

• Insertion Sort
• Selection Sort
• Quick Sort
• Merge Sort
• Heap Sort

Dynamic Programming

• 0/1 Knapsack Problem
• Rod Cutting Problem
• Longest Common Subsequence (LCS)

Greedy Algorithms

• Fractional Knapsack Problem
• Huffman Coding
• Activity Selection Problem

Topics Covered (Final)

1. BFS ✔️
2. DFS ✔️
3. Floyd–Warshall ✔️
4. Prim’s ✔️
5. Kruskal’s ✔️
6. Bellman–Ford ✔️
7. Dijkstra’s ✔️

We are following the textbook

• Introduction to Algorithms
  by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein (CLRS)