这是本文档旧的修订版！
Keywords
- 字符串匹配 Boyer-Moore algorithm
- 伪随机数:线性同余生成器 LCG(linear congruential generator) The generator is defined by the recurrence relation: $$ X_{n+1} = \left( a X_n + c \right)~~\bmod~~m $$ where $ X $ is the sequence of pseudorandom values, and
- $ m,\, 0<m $ – the “modulus”
- $ a,\,0 < a < m $ – the “multiplier”
- $ c,\,0 \le c < m $ – the “increment”
- $ X_0,\,0 \le X_0 < m $ – the “seed” or “start value”
oakfire