(a) For a positive integer n and n+1 constants cn, cn1, . . . , c1, c0 and a real number
Chapter 6, Problem 8(choose chapter or problem)
(a) For a positive integer n and n+1 constants cn, cn1, . . . , c1, c0 and a real number a, write an algorithm that uses the algorithm in Exercise 7 to compute ak, 0 k n and computes f(a), where f is the polynomial function defined by f(x) = cnxn+cn1xn1+ +c1x+c0 for each x R. (b) Determine the time complexity of the algorithm in (a), where ak, 0 k n, is computed by the algorithm in Exercise 7.
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