Write a C++ function that evaluates polynomials an an x
Write a C++ function that evaluates polynomials an an x
n + an-1 x
n-1
, ... , a2 x
2
,a1 x
1
, a0
x
0
. It should take following inputs:
• Value of x.
• Highest power n.
• Coefficients in descending order an , an-1 , ... , a2 , a1 , a0 (coefficients will ne
n+1)
For instance, if x=4 , n=3 & coefficients are [2,3,1,2], then output should be 182 which is
obtained by evaluating the polynomial 2 * 4 3 + 3 * 4
2 + 1 * 4
1 + 2 * 4
0
Function Prototype: double evaluatePolynomial();
Example01:******************************************************
x = 4
p = 3
Enter 4 coefficients in descending order of power
2
3
1
2
output: 182
Example02:******************************************************
x = -2.5
p = 7
Enter 8 coefficients in descending order of power
-2
0
0
-4.6
0
1
6
0
output: 1032.265625
Example03:******************************************************
x = -2.5
p = 0
Enter 1 coefficients in descending order of power
7
output: 7
Example04:******************************************************
x = -2.5
p = -4
output: Error (power must be >=0)
Note:
• Do not use built-in power function. And power must be >= 0 and integer.
• Do not use array or string etc.
• Read inputs inside evaluatePolynomial function.
• Display output in main function.
Step by step
Solved in 2 steps with 1 images
