Python3

Big O

Problem Description:

(Pattern matching)

Write a program that prompts the user to enter two strings and tests whether the second string is a substring in the first string. Suppose the characters in the second string are distinct. (Dont use the find method in the str class.) Analyze the time complexity of your algorithm. Your algorithm needs to be O(n) time.

Sample Run

Enter a string s1: Welcome to Python

Enter a string s2: come

matched at index 3

Analysis:

(Describe the problem including input and output in your own words.)

Design:

(? Describe the major steps (algorithm) for solving the problem.

Code:

Time Complexity of the Algorithm (Big O):

Test:

(Attach test cases and test results)