- 30

- 0

hello

any one can help me with this

thanx

The Horner’s method is an algorithm that evaluates polynomials. The following pseudocode shows how to use this method to find the

value of anxn + an-1xn-1 + . . . + a1x + a0 at x = c.

procedure Horner(c, a0, a1, a2, . . . , an : real numbers)

y := an

for i := 1 to n

y := y × c + an-i

end {y = ancn + an-1cn-1 + . . . + a1c + a0}

(a) Describe an algorithm that locates the last occurrence of the smallest element in a finite list of integers, where the integers in the list are not necessarily distinct. [5]

(b) Analyze the complexity of the algorithm you devised in Part (a), measured in terms of the number of comparisons

any one can help me with this

thanx

The Horner’s method is an algorithm that evaluates polynomials. The following pseudocode shows how to use this method to find the

value of anxn + an-1xn-1 + . . . + a1x + a0 at x = c.

procedure Horner(c, a0, a1, a2, . . . , an : real numbers)

y := an

for i := 1 to n

y := y × c + an-i

end {y = ancn + an-1cn-1 + . . . + a1c + a0}

(a) Describe an algorithm that locates the last occurrence of the smallest element in a finite list of integers, where the integers in the list are not necessarily distinct. [5]

(b) Analyze the complexity of the algorithm you devised in Part (a), measured in terms of the number of comparisons

**2. Homework Equations****3. The Attempt at a Solution**
Last edited: