I think the number of perations needed is 2n right?or 2n^2?
Hello!
can someone help me?i haven't done any of these before and i need real help
Given a sequence ofn + 1, (n ¸ 1) real numbers {a(0), a(1), ..., a(n)} and a real number c, consider the following algorithm :
p :=a(n)
for i from n-1 downto 0{,i.e. i=n-1,...,1,0}
p=c*p+a(i)
end
1)
Check which functionp(c) is computed for n = 3, 2, 1 ?
2)
Givef(n) the number of artithmetic operations needed to execute this
algorithm.
3)
Give alfa in f(n)=BIG THETA(n^alfa)
thank you