String Algorithms

The **naive string matching algorithm** is a brute-force approach that **checks every position in the text** for a match with the pattern. **Algorithm**: ```python def naive_string_match(text, pattern): n, m = len(text), len(pattern) matches = [] for i in range(n - m + 1): # Check if pattern matches at position i j = 0 while j < m and text[i + j] == pattern[j]: j += 1 if j == m: # Full match found matches.append(i) return matches ``` **Approach**: For each possible starting position, compare pattern character by character with text.