Finding Nth Fibonacci number in Recursive way - C#
Join the DZone community and get the full member experience.
Join For FreeFinding Nth Fibonacci number in Recursive way - C#
public int FindNthFibonacciNumber(int n)
{
if (n == 1 || n == 2) return 1;
int nthfibonacciNumber = FindNthFibonacciNumber(n - 1) + FindNthFibonacciNumber(n - 2);
return nthfibonacciNumber;
}
Opinions expressed by DZone contributors are their own.
Comments