1. Consider the following brute-force algorithm for evaluating a polynomial. Algorithm Brute Force Polynomial Evaluation (P[0..n],...

   

Transcribed Image Text:

1. Consider the following brute-force algorithm for evaluating a polynomial. Algorithm Brute Force Polynomial Evaluation (P[0..n], x) //Computes the value of polynomial P at a given point à //by the "highest to lowest term" brute-force algorithm //Input: An array P[0..n] of the coefficients of a polynomial of degree n, // stored from the lowest to the highest and a number //Output: The value of the polynomial at the point p+0.0 for in downto 0 do power 1 for j1 to i do power p+p+ P[i] * power return p power * x Find the total number of multiplications and the total number of additions made by this algorithm. 1. Consider the following brute-force algorithm for evaluating a polynomial. Algorithm Brute Force Polynomial Evaluation (P[0..n], x) //Computes the value of polynomial P at a given point à //by the "highest to lowest term" brute-force algorithm //Input: An array P[0..n] of the coefficients of a polynomial of degree n, // stored from the lowest to the highest and a number //Output: The value of the polynomial at the point p+0.0 for in downto 0 do power 1 for j1 to i do power p+p+ P[i] * power return p power * x Find the total number of multiplications and the total number of additions made by this algorithm.

Answer rating: 100% (QA)

Lets analyze the provided bruteforce algorithm for polynomial evaluation ... View the full answer