Home /
Expert Answers /
Computer Science /
problem-4-in-o-notation-what-is-the-worst-case-running-time-of-the-following-code-as-a-function-pa695
(Solved): Problem 4: In O-notation, what is the worst-case running time of the following code as a function ...
Problem 4: In O-notation, what is the worst-case running time of the following code as a function of \( n \) ? Give the best answer you can (the most informative symbol with the simplest function). Assume that all arithmetic operations, including the multiplication take a constant amount of time. All variables are integers.
Expert Answer
Answer : x <- 0 takes constant time. for i = 1 to n2 will execute n2 times x <- x+i will take constant time for j=1 to i will execute i times x<- x*j will take constant time The outer loop iterates on