Please use Python 3.6 l need the answer for question 16.10 i listed the algorith

Question

Please use Python 3.6 l need the answer for question 16.10 i listed the algorithms below that should be used in 16.10 16.10 (Execution time for prime numbers) write a program that obtains the execution time for finding all the prime numbers less than 8,000,000, 10,000,000, 12,000,000, 14,000 ,000, 16,000,000, and 18,000,000 using the algorithms in Listings 16.4-16. 6. Your program should print a table like this 8000000 10000000 12000000 14000000 16000000 18000000 Listing 16.4 Listing 16.5 Listing 16.6 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

Explanation / Answer

import time start_time = time.time() main() print("--- %s seconds ---" % (time.time() - start_time))

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---