Over a million developers have joined DZone.

Finding Nth Fibonacci number in Recursive way - C#

by
Aniruddha Deshpande
·
Jun. 02, 12 ·

Comment (0)

Save
Tweet
{{ articles[0].views | formatCount}} Views
Finding 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;
        }
Topics:

Comment (0)

Save
Tweet
{{ articles[0].views | formatCount}} Views

The best of DZone straight to your inbox.

SEE AN EXAMPLE
Please provide a valid email address.

Thanks for subscribing!

 Awesome! Check your inbox to verify your email so you can start receiving the latest in tech news and resources.
Subscribe

{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.linkDescription }}

{{ parent.urlSource.name }}
by {{ parent.authors[0].realName || parent.author}}
· {{ parent.articleDate | date:'MMM. dd, yyyy' }} {{ parent.linkDate | date:'MMM. dd, yyyy' }}
· {{ parent.portal.name }} Zone