Welcome to the Analysis and Design of Algorithms (ADA) repository! This repository contains a collection of notes and code snippets related to various algorithms, algorithmic techniques, and their analysis. Whether you're a student studying algorithms or a developer looking to refresh your algorithmic knowledge, you'll find valuable resources here.
- Introduction to Algorithms
- Sorting Algorithms
- Searching Algorithms
- Divide and Conquer
- Greedy Algorithms
- Dynamic Programming
- Graph Algorithms
- Binary Search Iterative
- Binary Search Recursive
- Selection Sort
- Quick Sort
- Merge Sort
- Fractional Knapsack
- Kruskal's Algorithm
- Prim's Algorithm
- Strassen's Matrix Multiplication
- 0/1 Knapsack Problem
- Dijkstra's Algorithm
- Longest Common Subsequence
- Breadth First Search
- Depth First Search
- N-Queen Problem
Browse through the directories to find notes written in Markdown format and code snippets implemented in various programming languages. Each section covers different algorithms, techniques, or topics. Feel free to explore, learn, and even contribute!
Contributions are welcome! If you have additional notes, better explanations, or more efficient code snippets, please consider opening a pull request. Be sure to follow the contribution guidelines.
Happy coding and exploring algorithms!