Program Plan: In the program, we include the header files as needed. Function prototype will be declared. Declaring main() function as integer type. Variable declaration : varialesnum_series,iloopare user defined numbers declared as integer type in the main(). The variable num_seriescarried with the non_recursive_fibonacci_series(). user_series is a variable declared as integer type declared in non_recursive_fibonacci_series() function to carry the user input to the function. Calling the non_recursive_fibonacci_series() in the main(). non_recursive_fibonacci_series() :this function will help to find out the Fibonacci numbers. Declaring the variables the_start_fib_num, the_second_fib_num,the_next_fib_num as integer type andinitializing the variables with 0,1,0 respectively to avoid garbage value. non_recursive_fibonacci_series() function returns the result.

Question

Want to see the full answer?

Answer 1

Question

Chapter 6, Problem 6.37E

Program Plan Intro

Program Plan:

In the program, we include the header files as needed.

Function prototype will be declared.

Declaring main() function as integer type.
Variable declaration : varialesnum_series,iloopare user defined numbers declared as integer type in the main(). The variable num_seriescarried with the non_recursive_fibonacci_series().
user_series is a variable declared as integer type declared in non_recursive_fibonacci_series() function to carry the user input to the function.

Calling the non_recursive_fibonacci_series() in the main().
non_recursive_fibonacci_series() :this function will help to find out the Fibonacci numbers.

Declaring the variables the_start_fib_num, the_second_fib_num,the_next_fib_num as integer type andinitializing the variables with 0,1,0 respectively to avoid garbage value.

non_recursive_fibonacci_series() function returns the result.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

B. Using Algebraic manipulation, simplify the following function. H(A.B,C,D)=( B + C )(A + D ) + D (AC+AB)

(Recursive Greatest Common Divisor) The greatest common divisor of integers x and y isthe largest integer that evenly divides both x and y. Write a recursive function gcd that returns thegreatest common divisor of x and y. The gcd of x and y is defined recursively as follows: If y is equalto 0, then gcd(x, y) is x; otherwise gcd(x, y) is gcd(y, x % y), where % is the remainder operator.

Redo the program given where you have to define and use the following functions: (a) isTriangle - takes 3 sides of a triangle and returns true if they form a triangle, false otherwise. (b) isIsosceles - takes 3 sides of a triangle and returns true if they form an isosceles triangle, false otherwise. (c) isEquilateral - takes 3 sides of a triangle and returns true if they form anequilateral triangle, false otherwise. (d) isRight - takes 3 sides of a triangle and returns true if they form a right triangle, false otherwise. (e) your program should run continuous until the user wants to quit The given program: #include <iostream> #include <cmath> using namespace std; // Constant Declarations const double E = .0001; int main() { double side1, side2, side3; bool isTriangle, isRight, isEquilateral, isIsosceles; cout << "Enter the lengths of the 3 sides of a triangle -- "; cin >> side1 >> side2 >> side3; isTriangle = side1 + side2 > side3 &&side1…