Skip to content

README.md

Latest commit

 

History

History
32 lines (23 loc) · 952 Bytes

README.md

File metadata and controls

32 lines (23 loc) · 952 Bytes

📘 Topics Covered

  • Complexity Analysis (Time & Space)
  • Sorting Algorithms (Merge, Quick, Heap, etc.)
  • Searching Algorithms (Linear, Binary)
  • Recursion & Backtracking (N-Queens, Maze Solver, etc.)
  • Dynamic Programming (Knapsack, LCS, Fibonacci, Matrix Chain Multiplication)
  • Greedy Algorithms (Activity Selection, Huffman Coding, MST)
  • Graph Algorithms (DFS, BFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Kruskal, Prim)
  • Trees & Binary Trees (Traversals, BST operations)
  • Heaps & Priority Queues
  • Hashing & Hash Tables
  • String Algorithms (Pattern Matching, etc.)

🛠️ Tech Stack

  • Language: Java (JDK 17 / 22)
  • IDE: VS Code / IntelliJ IDEA / Eclipse
  • Version Control: Git & GitHub

🚀 How to Run

  1. Clone the repository: 
    git clone https://github.com/your-username/Algorithm_DesignImplementation.git