Search for question
Question

6. Suppose the following algorithm is used to evaluate the polynomial p(x)=a_{n} x^{n}+a_{n-1} x^{n-1}+\cdots+a_{1} x+a_{0}

A. How many multiplications are done in the worst case? How many additions? B. How many multiplications are done on average case?

Fig: 1

Fig: 2

Fig: 3

Fig: 4

Fig: 5