Question: C++ analyze the following algorithm and give a theoretical upper bound (worst case). Explain your answer. myFunc(int n) sum=0 for i=0 to n ; i++
C++
analyze the following algorithm and give a theoretical upper bound (worst case).
Explain your answer.
myFunc(int n)
sum=0
for i=0 to n ; i++
for j=0 to n ; j++
sum+=i*j
print sum
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
