Question

Take my hyperbolic sin/cos recursive function place the angle on a sine or cosine stack that represents a call to the sine or cosine. When the program returns, examine the stack for how many times the hyp sine was called and how many times hyp sine/cosine was called vs. the value you inputted into the program. Put the results in a table. Range of values from -1 to 1 in .1 radian increments. Does the number of function calls agree with what you predict it should be?

Mentioned code is below *** Answer must be working C++ Code ***

#include
#include
#include
#include
using namespace std;

float h(float);
float g(float);

int main(int argc, char** argv) {
//Testing out recursive trig functions
float angDeg=45;
float angRad=angDeg*atan(1)/45;
cout<<"Angle = "<

Answer 1

according to Q statement i have calculated number of stack calls from g and h functions

#include <iostream>
#include <cstdlib>
#include <ctime>
#include <cmath>
using namespace std;
int number_of_h=0;
int number_of_g=0;
float g(float angle);
float h(float angle)
{
number_of_h++;
float t = 1e-6;
if (angle > -t && angle < t)
return angle + angle * angle * angle / 6;
return 2 * h(angle / 2) * g(angle / 2);
}
float g(float angle)
{
number_of_g++;
float t = 1e-6;
if (angle > -t && angle < t)
return 1 + angle * angle / 2;
float bd = h(angle / 2);
return 1 + 2 * bd * bd;
}

int main(int argc, char **argv)
{
//Testing out recursive trig functions
float angDeg = 46;
float angRad = angDeg * atan(1) / 45;
number_of_g=0;
number_of_h=0;
cout << "Angle = " << angDeg << " sinh = " << sinh(angRad) << " our h = " << h(angRad) << endl;
cout<<"h\t"<<number_of_h<<endl<<"g\t"<<number_of_g<<endl;
number_of_g=0;
number_of_h=0;
cout << "Angle = " << angDeg << " cosh = " << cosh(angRad) << " our g = " << g(angRad) << endl;
cout<<"h\t"<<number_of_h<<endl<<"g\t"<<number_of_g<<endl;
//Exit stage right
return 0;
}

u.CAU Angle 46 sinh = 0.891923 our h = 0.891923 28656 17710 g Angle = 46 cosh 1.33997 our g 1.33997 17710 10946

COMMENT DOWN FOR ANY QUERIES AND,

LEAVE A THUMBS UP IF THIS ANSWER HELPS YOU.