Advanced Algorithms
Università degli Studi di Udine · A.A. 2025–2026
Advanced Algorithms
Interactive visualizations for the course lecture notes. Step through classic algorithms with custom inputs — all running directly in your browser.
Chapter 1 — String Matching
01
Naive String Matching
Step through every alignment of pattern P against text T
02
KMP
Failure function (sp values) and search with fallback arrows
Standalone visualizer
03
Z-Algorithm
Z-array computation with Z-box reuse
04
Boyer-Moore
Right-to-left scanning with the bad character rule
05
Suffix Trie & Suffix Tree
Build and visualize suffix structures interactively
06
Algorithm Comparison
Side-by-side character comparison counts across algorithms
07
Keyword Tree
Multiple pattern matching: tree builder and search visualization
08
Rabin-Karp
Rolling hash fingerprinting: watch hash collisions and spurious hits in action
09
Shift-And
Bit-parallel matching: alphabet masks, DP matrix, and bit-vector operations
9 notebooks
Chapter 1 — String Matching
All interactive · runs in-browser