Question: Consider the following algorithm: FUNCTION foo ( n ) s : = 0 FOR i : = 1 TO n DO s : = s

Consider the following algorithm:
FUNCTION foo( n )
s :=0
FOR i :=1 TO n DO
s := s + i * i
RETURN s
Analyse the algorithm and determine:
1. What is its basic operation?
2. How many times is the basic operation executed?
3. What is the eciency class of this algorithm?
4. What does this algorithm compute?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

Q:

Discrete math er the following algorithm: function bar (n) for 0 s is n qux a. 0(n2) for 1 s j s n b. 000g n) qux for i s k s n c. 0 (n') qux If the time complexity of this algorithm was to be...

Q:

Algorithm Analysis Problems #5) Please explain the solution thoroughly it's more important than the answer itself. Here is my class work and a provided link to origonal word document. Thank You....

Q:

VI) Consider the following algorithm: procedure foo (a,,a2, temp 0 i:= 2 ,an: positive integers) while i n and temp = 0 if a ai then temp i else i i+1 return temp Describe what this algorithm does...

Q:

Asymptotic running time problem. Try to analyze the following algorithm. Function Foo (n) if n > 1 then Foo (n/3) for i from 1 to n do Print 'B' end Foo(n/3) end a) What is the running time of the...

Q:

Try to analyze the following algorithm. Function Foo (n) if n > 1 then Print 'A' Foo (n/3) for i from 1 to n do | Print 'B' end Foo(n/3) end a) What is the running time of the function Foo(n)? Give...

Q:

5. (10 pts) (i) (3 pts) Consider the following algorithm. function recursive (n>=1:integer) :integer if n=1 then return (1) else return (recursive (n/3) + recursive (2*n/3)) endif Let T(n) (n 2 1)...

Q:

Question 2 1 pts Consider the following algorithm: function Choose $(n \in\{0,1,2, \ldots }, k \in\{0,1,2, \ldots\})$ if $k=0$ or $k=n$ then return 1 else return Choose $(n-1, k-1)+$ Choose $(n-1,...

Q:

Question 2 1 pts Consider the following algorithm: function Choose $(n \in\{0,1,2, \ldots }, k \in\{0,1,2, \ldots\})$ if $k=0$ or $k=n$ then return 1 else return Choose $(n-1, k-1)+$ Choose $(n-1,...

Q:

Question 2 1 pts Consider the following algorithm: function Choose $(n \in\{0,1,2, \ldots }, k \in\{0,1,2, \ldots\})$ if $k=0$ or $k=n$ then return 1 else return Choose $(n-1, k-1)+$ Choose $(n-1,...

Q:

5. (10 pts) (i) (3 pts) Consider the following algorithm. function recursive (n>=1:integer) :integer if n=1 then return (1) else return (recursive (n/3) + recursive (2*n/3)) endif Let T(n) (n 2 1)...

Q:

If the mass of the proton were just a little closer to the mass of the neutron, the following reaction would be possible even at low collision energies: e + p n + v. why would this situation be...

Q:

You have been assigned to the audit of Utopia Industries, Inc., for the year ended December 31, 20X1. The company makes components for communications and defense applications. To obtain an...

Q:

The governmentwide financial statements use the a . Economic resources measurement focus and the accrual basis of accounting. b . Current financial resources measurement focus and the accrual basis...

Q:

How to do Show that the function f ( x ) = a* +a * is strictly increasing on (0, co ), where a is a pos constant with a # 1