The nth Fibonacci number must be returned by an iterative C++ function that takes a non-negative integer n as an input.
One of the most well-known mathematical formulas is the Fibonacci sequence. The sum of the two numbers before it determines each number in the series. As a result, the order is as follows: 0; 1; 2; 3; 5; 8; 13; 21; 34; and so on. It can be expressed mathematically as Xn+2=Xn+1 + Xn.
There are 4 things in this assignment that need to be finished. Writing an iterative C++ function that accepts a non-negative integer n as an input and returns the nth Fibonacci number is required for the first challenge. The second challenge requires us to create a recursive C++ function that takes a non-negative integer n as an input and returns the nth Fibonacci number as a result.
Know more about function here:
https://brainly.com/question/9171028
#SPJ4
