Back to Hub Searching Algorithms

Searching Visualizers

From a brute-force linear scan to multi-pattern automata — pick a sandbox to step through the algorithm live.

Binary Search

Classic divide-and-conquer search on sorted arrays. Watch the search space halve with each comparison.

Sequential scan through unsorted data. The baseline every faster algorithm is measured against.

Move a window over an array to solve subarray problems in O(n). Watch bounds shift and the running sum update.

Multi-pattern string matching with failure links. Find all patterns simultaneously in a single O(n+m+z) pass.