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.
Searching Algorithms PHP 5.0+ Linear search is O(n) and works on any array. Binary search is O(log n) but requires a sorted array. Hash lookup is O(1) and the right choice for most in-memory searches.
2mo ago
algorithms intermediate
Sliding Window An algorithmic technique that maintains a window of elements over a sequence, expanding or contracting it to find subarrays or substrings satisfying a condition in O(n).
2mo ago
algorithms intermediate
Sorting Algorithms PHP 5.0+ Algorithms for ordering a collection — ranging from O(n²) simple sorts to O(n log n) comparison sorts and O(n) non-comparison sorts for specific data.
2mo ago
algorithms intermediate
String Algorithms
Efficient string searching (KMP, Boyer-Moore, Rabin-Karp), edit distance (Levenshtein), and compression algorithms — foundational for search, diff tools, and bioinformatics.
2mo ago
algorithms advanced