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.
Dijkstra's Shortest Path Algorithm PHP 5.3+ A greedy graph algorithm that finds the shortest path from a source node to all other nodes in a weighted graph with non-negative edge weights.
1mo ago
algorithms advanced
Divide and Conquer Recursively break a problem into smaller subproblems, solve each independently, and combine results — the strategy behind mergesort, quicksort, binary search, and FFT.
2mo ago
algorithms intermediate
Dynamic Programming PHP 5.0+ An optimisation technique that solves problems by breaking them into overlapping subproblems, storing results to avoid redundant computation.
2mo ago
algorithms advanced