Algorithms-Solutions

Beyond just code: most solutions include detailed logic explanations and step-by-step visualizations.

Если было полезно — поставь ⭐, это очень помогает!

If you found this useful, consider leaving a ⭐ — it helps a lot!

Name		Name	Last commit message	Last commit date
Advanced Heap Tasks: Remembering Element Positions in a Heap		Advanced Heap Tasks: Remembering Element Positions in a Heap
Basic concepts of graph theory. Input, output, storage methods		Basic concepts of graph theory. Input, output, storage methods
Binary search: left and right		Binary search: left and right
Breadth-first traversal		Breadth-first traversal
Counting sort		Counting sort
Depth bypass		Depth bypass
Dijkstra's algorithm		Dijkstra's algorithm
Dynamic programming with two parameters. The turtle problem.		Dynamic programming with two parameters. The turtle problem.
Elementary data structures: stack, queue, deque. Cyclic queue		Elementary data structures: stack, queue, deque. Cyclic queue
Heap data structure		Heap data structure
Optimizing Dijkstra's Algorithm Using Heap(*)		Optimizing Dijkstra's Algorithm Using Heap(*)
Quadratic sorts: bubble sort, selection sort		Quadratic sorts: bubble sort, selection sort
Quadratic sorts: insertion sort. Complexity assessment of algorithms		Quadratic sorts: insertion sort. Complexity assessment of algorithms
Quicksort. k-th order statistics (*)		Quicksort. k-th order statistics (*)
README.md		README.md
Real binary search. Binary search by answer		Real binary search. Binary search by answer
Recursion. Classic recursion problems		Recursion. Classic recursion problems
The principle of dynamic programming: base, parameters, transition		The principle of dynamic programming: base, parameters, transition
Topological sorting		Topological sorting

Navigation Menu