In this homework, you are going to implement a program which accepts two strings (str, pat) and checks whether pat appears as substrings in str. In the lectures, we saw program ex016 and ex017 that ...

#shorter than target string. #Hint: Don't be surprised if you find that the "End" case #is the toughest! You'll need to look at the lengths of #both the target string and the search string. #Below are ...