Naive Pattern Matching
Algorithm
Slide pattern over text, comparing character by character at each position.
def naive_search(text: str, pattern: str) -> list[int]:
n, m = len(text), len(pattern)
positions = []
if m == 0 or m > n:
return positions
for i in range(n - m + 1):
match = True
for j in range(m):
if text[i + j] != pattern[j]:
match = False
break
if match:
positions.a
[Description truncada. Veja o README completo no GitHub.]