Consider the following algorithm.
ALGORITHMMystery(n)
//Input: A nonnegative integer n
S←0
fori←1 to n do
S←S+i∗i
return S
a.What does this algorithm compute?
b.What is its basic operation?
c.How many times is the basic operation executed?
d.What is the efficiency class of this algorithm?
e.Suggest an improvement, or a better algorithm altogether, and indicate itsefficiency class. If you cannot do it, try to prove that, in fact, it cannot bedone.
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.