Question

Need answer in Python 3.8, with indentation and comments shown, please.

16.4* (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. (Don't use the find method in the str class.) Analyze the time complexity of your algorithm. Here is a sample run of the program <output> Enter a string s1: Mississippi Enter a string s2: sip matched at index 6 <End Output>

Answer 1

Answer:

Here is the python code as per yuor requirement

Raw code:

#getting two string and making them as lower case

s1=input("Enter a string s1: ").lower()

s2=input("Enter a string s2: ").lower()

#checking if the string 2 is exist in the string 1

if s2 in s1:

#if yes print the index value of string 2 in string1

print("matched at index",s1.index(s2))

#else print that there is no substring

else:

print("not matched")

Code in the editor:

1 2 3 4 5 #getting two string and making them as lower case sl=input("Enter a string s1: "). lower() s2=input("Enter a string s2: "). lower() #checking if the string 2 is exist in the string 1 if s2 in s1: #if yes print the index value of string 2 in string1 print("matched at index", s1. index(52)) #else print that there is no substring 7 00 else: 9 10 print("not matched")

output:

ed folder/statistics.py" Enter a string s1: Mississippi Enter a string s2: sip matched at index 6 Ajay-Kumars-MacBook-Air: untitled folder

Hope this helps you! If you still have any doubts or queries please feel free to comment in the comment section.

"Please refer to the screenshot of the code to understand the indentation of the code".

Thank you! Do upvote.