Question: 1.Describe the worst-case input for this algorithm. 2.How many multiplications are done in the worst-case? How many additions? 3.How many multiplications are done on the

 1.Describe the worst-case input for this algorithm. 2.How many multiplications are

1.Describe the worst-case input for this algorithm.

2.How many multiplications are done in the worst-case? How many additions?

3.How many multiplications are done on the average?

4.Can you improve this algorithm? If so, explain how and provide some pseudocode.

Suppose the following algorithm is used to evaluate the polynomial p(x) = anz" + an-1Xn_H+ aix + a0: Input: Array A such element Ali]ai EVALUATE(A) 1 pao 2 x-pow = 1 3 for i=1 to n 4

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!