This algorithm works if you wanna search a smaller string inside a longer string. And they'll return the no of occurrences of that small string.
Naive Search - Pseudocode
Create a function that accepts a long string and a shorter string
Loop over the longer string. Inside that, we should loop over the smaller string.
If the string characters don't match we should break out from the inner loop
If the string matches we need to continue the loop for the rest of the smaller string
If the match was found we should increment the no of matches
Finally, we need to return the count.
The code is mentioned below
Thanks for reading. Hope you'll find it useful
Top comments (0)