This repository hosts a diverse collection of implemented algorithms across various domains in computer science. From foundational sorting and searching techniques to advanced graph algorithms and dynamic programming, this repository provides a comprehensive resource for understanding and implementing essential algorithms.
- Search Techniques:
- Linear Search
- Binary Search
- Sorting Algorithms:
- Selection Sort
- Insertion Sort
- Count Sort
- Divide and Conquer:
- Merge Sort
- Quick Sort
- Graph Algorithms:
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Shortest Path Algorithms
- Floyd–Warshall
- Bellman-Ford
- Dijkstra
- Minimum Spanning Trees
- Prim's
- Kruskal's
- Topological Sorting:
- Kahn's Algorithm
- Dynamic Programming
- Backtracking