A Python implementation of the Naive Pattern Search algorithm.

Naive Pattern Search: Python

You have now built a naive pattern search, congratulations!

The algorithm begins by iterating through the `text` and setting a variable `match_count` equal to `0`. 

Then, for each index of the `text`, the algorithm iterates through the `pattern` to check for matching characters, and if found, increments `match_count`. Otherwise, the search breaks the `pattern` iteration and moves onto the next index in `text`. 

Each time the `pattern` iteration is completed, the `match_count` is compared to the length of the `pattern` to determine if a match is found.

Now there is only one thing left to do, test the algorithm on more inputs!

Testing the Search

Now that we are looping through both the `text` and the `pattern`, we can begin to compare the two to check for matches. For each character of the `text`, we want to check if the subsequent characters match the `pattern`. These matches will then be counted to later determine if the `pattern` exists in the `text`.

While iterating over the `pattern` indices, the first character of the `pattern` can be compared to the currently iterated character of the `text` with the following comparison:

```py
if pattern[0] == text[index]:
  # Do something
```

To make the above comparison more dynamic, and compare the entirety of the `pattern`, the current `char` index can be added to both of the above indices.


Counting Pattern Matches

To search through a text means to iterate through it and check each character based on some criteria. 

With our naive pattern search, we will:
- Iterate through each character of the text.
- For each character of the text, count the number of following characters that match the pattern.
- Check if that match count equals the length of the pattern.

If the match count equals the length, then a pattern has been found!

In this first exercise we will tackle iterating through the text and pattern.
