$./bm-computed
pattern:
2 step/s
# algorithm
1ComputeD(p) {m = |p|}
2begin
3 j ← Rnext[m] ← m + 1
4 for i ← m downto 1 do
5 while j ≤ m and p[i] ≠ p[j] do
6 if D[j] undefined then D[j] ← j − i
7 j ← Rnext[j]
8 od
9 j ← j − 1; Rnext[i − 1] ← j
10 od
11 p ← Rnext[0]
12 for j ← 0 to m do
13 if D[j] undefined then D[j] ← p
14 if j = p then p ← Rnext[p]
15 od
16end
# pattern (1-indexed)
no data
# variables
i
—
j
—
p (var)
—
m
10
p[i]
—
p[j]
—
# D array - Good Suffix Shift (0-indexed)
no data
# Rnext array - Reverse Next (0-indexed)
no data
# current action
enter a pattern and click "run" to begin...
# assignment history
stepijDRnextaction