Func2(n) 1 2 3 4 5 6 7 S← 0; for in to 2n do for j end 10i + 7 to 10i + 21 do s ← s + i − j; ss+i- end return (s);

icon
Related questions
Question

Please help with this question:

Determine the running time of the following algorithms. Write summations to represent loops and simplify. Show all work. If bounding is used, the upper and lower bounds must only differ by a constant.  Note:  This is not the line-by-line analysis method. Loops are inclusive.

b)
Func2(n)
1
2
3
4
5
6
7
S← 0;
for in to 2n do
for j
end
10i + 7 to 10i + 21 do
ss + i- j;
end
return (s);
Transcribed Image Text:b) Func2(n) 1 2 3 4 5 6 7 S← 0; for in to 2n do for j end 10i + 7 to 10i + 21 do ss + i- j; end return (s);
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer