Algorithms terms
The step-by-step logic that powers efficient computation
Algorithms are the precise recipes that transform inputs into outputs efficiently. This category covers sorting, searching, graph traversal, dynamic programming, greedy approaches, divide-and-conquer, and complexity analysis. Understanding algorithmic thinking helps you recognise patterns in problems and reach for the right solution rather than reinventing a worse one.
Algorithms for traversing, searching, and finding paths in graphs — BFS for shortest hops, DFS for exploration, Dijkstra for weighted shortest paths.
2mo ago
algorithms advanced
Algorithms that make the locally optimal choice at each step — fast and simple, but only produce the globally optimal solution for problems with the greedy choice property.
2mo ago
algorithms intermediate