Horners method -  C program:

Modify the program to implement the details for the recursive function called horners(double b, int n) that calculates Horner's method for a coefficient of 1 and a given value of b and for integer n. Horner's method for this problem is define as 1 + b * (1 + b * (1 + b * ( 1 + . . . + b))).

#include

#include

#include

#include

using namespace std;

double horners(double b, int n);

int main(int argc, char **argv)

{

             cout << "horners(2, 4)  = " << horners(2, 4) << endl;

             cout << "horners(3, 2)  = " << horners(3, 2) << endl;

             cout << "horners(5, 5)  = " << horners(5, 5) << endl;

             cout << "horners(10, 3) = " << horners(10, 3) << endl;

             cout << "horners(13, 2) = " << horners(13, 2) << endl;

             cout << endl << "Press any key to continue." << endl;

            getchar();

   return 0;

}

double horners(double b, int n)

{

   //     using recursive definition

  //       1 + b * (1 + b * (1 + b * ( 1 + . . . + b)));   

    return 0.0;

}

/*

Output will be

horners(2, 4) = 31

horners(3, 2) = 13

horners(5, 5) = 3906

horners(10, 3) = 1111

horners(13, 2) = 183