Consider the following algorithm (known as Horners rule) to evaluate f(x) = Ni=0
Chapter 2, Problem 2.14(choose chapter or problem)
Consider the following algorithm (known as Horners rule) to evaluate f(x) = Ni=0 aixi:poly = 0;for( i = n; i >= 0; i-- )poly = x * poly + a[i];a. Show how the steps are performed by this algorithm for x = 3, f(x) = 4x4 +8x3 + x + 2.b. Explain why this algorithm works.c. What is the running time of this algorithm?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer