Give two strings, how to compute the number of occurrences of second string in the first

This sounds like your homework, so I'll give you no code! :laugh:

It's not complex, all you have to do is look at it as if it was you doing it, rather than a computer.

You would take the second string (lets call it match) and look for the first occurance in the first string (lets call it source). You would then ignore all the characters in the source up to the beginning of the match you found (plus a bit to make sure you didn't find the same one again) and look for another. And then you would repeat this until teh amount of the source you had left was shorter than the match

So: here is how I would do it:

Create a function, called IsMatch - it returns true if it's a match and false if it isn't.
It takes two parameters, both char*, the first is the source, the second is the match - we will assume that both are null terminated.
Then loop through the strings:
if *source is null, return false.
if *source is not the same as *match, return false.
otherwise, move source and match one one.
if *match is null, return true.
otherwise, go back round the loop.

Then all you have to do is call it in another loop:
each time you go round, call it with source and match. If it returns true, increment your count.
Move source on by one. If *source is null, exit the loop.


All done!