Huh? I'm sorry, but that doesn't make much sense to me...
Are you saying that that's how the "naive" search string algorithm is supposed to work, or are you saying that that's what my code does? Because it seems like to me, that both are false.
What my code does is it searches for the first character of searchStr in sourceStr, and if it finds it, it then iterates through both strings (starting with the next character up from what was already compared, i.e. the first character of searchStr and the current character of sourceStr), comparing each character. If it finds one that's not a match, it breaks from the inner for loop, after first setting a bool variable called "just_broke" as true. An if statement after the inner for loop then checks to see if just_broke is true or not. If it is not, then we know that it found the entire searchStr in the sourceStr, therefore we return true right away. If it is, then we continue iterating through sourceStr, looking for the first character of searchStr, and go through the whole process again if we find another match. That is basically the logic behind my code, though it does a few other things too.
I honestly cannot make heads or tails of what you just said, in relation to my code, for it sounds like you're saying I should be searching for multiple characters sequentially (i.e. one right after the other) in sourceStr that match the first character of searchStr.