Recursive function to find nth number of the Fibonacci series?

Answer 1

STEP1. Set value of count=1, output=1, T1=0, T2=1

STEP2. Read value of n

STEP3. Print output

STEP4. Calculate

output=T1+T2

STEP5. T1=T2 & T2=output

STEP6. Calculate count= count+1

STEP7. If (count<=n>

go to STEP3

else

go to STEP8

STEP8. End

You could also just plug in n into this formula:

F(n) = [φ^n - (1-φ)^n] / sqrt(5)

φ is about 1.618033989 and is the Golden Ratio

[It's also the limit as n approaches infinity of the nth term in the Fibonacci sequence divided by the (n-1)th term]

Answer 2

#include
#include

using std::cin;
using std::cout;
using std::endl;
using std::tolower;

long factorial(const int& N);

int main()
{
int N = 0; //factorial of N
char command = 'n';
do
{
cout << "Enter a number to calculate factorial: ";
cin >> N;

cout << endl << "Factorial of " << N << " is: " << factorial(N) << endl;

cout << "Do you want to continue (y/n)?";
cin >> command;
cout << endl;
} while ('y' == tolower(command));

system("PAUSE");
return 0;
}

long factorial(const int& N)
{
if (N == 0)
{
return 1;
}
else
{
return (N * factorial(N - 1));
}
}

Answer 3

ops sorry .......................................