Sign In Sign Up Ask an AI advisor
datboyjulio21
datboyjulio21
04.11.2019 • 
Mathematics

There is a more efficient algorithm (in terms of the number of multiplications and additions used) for evaluating polynomials than the conventional algorithm described in the previous exercise. it is called horner's method. this pseudocode show how to use this method to find the value of
a_nx^n+a_{n−1}x^{n−1}++a_1x+a_0 at x=c
procedure horner(c, a₀, a₁, a₂ a_n: real numbers)
y: =a_n
for i: =1 to n
y: =y∗c+a_{n-i}
{y=a_nc^n+a_{n-1}c^{n-1}++a_1c+a_0}
a) evaluate 3x²+x+1 at x=2 by working through each step of the algorithm showing the values assigned at each assignment step.
b) exactly how many multiplications and additions are used by this algorithm to evaluate a polynomial of degree n at x=c? (do not count additions used to increment the loop variable.

Solved
Show answers

Ask an AI advisor a question

I want advice