Answered step by step
Verified Expert Solution
Question
1 Approved Answer
For each of the following three code snippets (corresponding Python code is list in the Appendix at the end of this assignment): Calculate the
For each of the following three code snippets (corresponding Python code is list in the Appendix at the end of this assignment): Calculate the theoretical time complexity by counting the number of subtractions as basic operation. What do you think is the Big-Oh for the complexity? Prove how did you get the big-Oh only for Code Snippet 1. b. Plot a graph of the theoretical time complexity. c. Implement the code in the language of your choice, and find the running time for several values of n (for . instance, for n= 1000, 2000, 3000...10000) and plot the results. (make sure not to have other applications running in the background. You can use different values for n as you see fit). Submit the full code as an appendix to your assignment. d. Using the two plotted graphs, comment on the growth rate of the theoretical time complexity in comparison with the actual running times. Code Snippet 1. NegativeSum for (i = 1; i Part Snippet 3. NegativeSubSum for (i = 1; i Appendix A (Python code for the code snippets in Question I) 1. Code Snippet 1 NegativeSum for i in range (1, n+1): NegativeSum = NegativeSum i 2. Code Snippet 2 Negative3Sum for i in range (1, (n*3)+1): Negative3Sum Negative3Sum i 3. Code Snippet 3 NegativeSubSum for i in range (1, n+1): for j in range (1, i+l): NegativeSubSum = NegativeSubSum - j
Step by Step Solution
★★★★★
3.45 Rating (152 Votes )
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