This repository contains implementations of various algorithms, including sorting, graph, and dynamic programming. It also includes solutions to specific problems from laboratory exercises and exams.
- Quick Sort
- Merge Sort
- Heap Sort
- Quick Select
- Bucket Sort
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Dijkstra's Shortest Path
- Topological Sort
- Prim
- Kruskal
- Bellman Ford
- Floyd Warshall
- Strongly Connected Components finding
- Ford Fulkerson
- Articulation Points finding
- Bridge finding
- Euler's Cycle finding
This section provides solutions using dynamic programming approaches for problems such as:
- Longest Increasing Subsequence (LIS)
- Longest Common Subsequence (LCS)
- Traveling Salesman Problem (TSP)
- Knapsack Problem
- 2D Knapsack Problem
- Various less popular problems and exercises