Brute Force Pattern Matching

Analysis

	Best Case	Worst Case
No occurrences
Single occurence
All Occurencess

Pseudocode

bruteforce(text, pattern) {
	n = len(text)
	m = len(pattern)
	for n length substring in text from left to right {
		if current substring matches pattern { return current index } 
	}
	return pattern not found
}