Algorithm: Brute Force

i := 1
WHILE i <= n-m+1 DO
  j := 1
  WHILE j <= m AND pat[j] = text[i+j-1] DO
    j := j+1
  END
  IF j = m+1 THEN RETURN TRUE
  i := i+1
END
RETURN FALSE

Time complexity: O ((n-m) · m)
Space complexity: O (1)

Back to the Applet