Consider the following algorithm to evaluate f(x) = -0 air (Horner's rule): poly = 0; for(i=n;...

  

Transcribed Image Text:

Consider the following algorithm to evaluate f(x) = -0 air (Horner's rule): poly = 0; for(i=n; i>=0; i--) poly = r * poly + ai 3. What is the running time of this algorithm with the following assumptions? What is its big-O notation? Statement assignment + * for-next loop set-up each loop Time Unit 1 1.25 1.75 2.3 1.5 Consider the following algorithm to evaluate f(x) = -0 air (Horner's rule): poly = 0; for(i=n; i>=0; i--) poly = r * poly + ai 3. What is the running time of this algorithm with the following assumptions? What is its big-O notation? Statement assignment + * for-next loop set-up each loop Time Unit 1 1.25 1.75 2.3 1.5

Answer rating: 100% (QA)

Solution A fx4x8xx2 for x3 2x481 2313 23941 B To conver... View the full answer