ended9월 8일· 1 sources

Bitap: my favorite string matching algorithm

Why it matters

A classic problem is to find the first occurrence of a pattern $P$ in a string $T$. There are various classic (and very elegant!) algorithms to solve this problem efficiently, such as Boyer-Moore, Knu...

1
Sources
+0
24h
Growth
13d
Active

Sources

Related Issues