⬡
AlgoVisualiser
Sorting
Searching
Stack
Queue
Trees
Graphs
Linked List
Hashing
DP
Greedy
Backtracking
Strings
Math
String Algorithms
Visualize pattern matching algorithms character by character
Naive
Brute force O(nm)
KMP
Failure function O(n+m)
Rabin-Karp
Rolling hash O(n+m)
Z Algorithm
Z-array O(n+m)
Enter text & pattern, then click Visualize
Input
Text (max 100 chars)
Pattern (max 20 chars)
Visualize
Step 0
of 0
⏮
◀
▶
▶
⏭
Speed
×5
Slow
Fast
Complexity
Time
O(nm)