Question
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
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)
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started