Problem 7
Given a character text string, there may be substring patterns in the text.
Text: "This is a test string to search patterns in", Patterns: "is a", "sea", "string", "ring".
Write a function (or describe the algorithm) that finds multiple patterns in such a text.
What is the complexity of your solution? Can you describe an algorithm that visits each byte in the text just once? The speed of the solution is important.
no one will do your homework.
especially not, if you just copy paste the task here without asking any real question.

What help you want? Just copying the question to forum will not help you.

How far could you go?
What algorthm you are thinking of?
Do you understand complexity?
Do you know how speed is effected by numder of elements?
Topic archived. No new replies allowed.