Over a million developers have joined DZone.

Finding Nth Fibonacci number in Recursive way - C#

DZone's Guide to

Finding Nth Fibonacci number in Recursive way - C#

by

Aniruddha Deshpande

·

Jun. 02, 12 · ·

Free Resource

Like (0)

Comment (0)

Save

{{ 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;
        }

DOWNLOAD

Topics:

Like (0)

Comment (0)

Save

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

Opinions expressed by DZone contributors are their own.

by {{ parent.authors[0].realName || parent.author}}

· {{ parent.articleDate | date:'MMM. dd, yyyy' }} {{ parent.linkDate | date:'MMM. dd, yyyy' }}

· {{ parent.portal.name }} Zone

Finding Nth Fibonacci number in Recursive way - C#

Finding Nth Fibonacci number in Recursive way - C#

{{ editionName }}

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

{{ parent.tldr }}

{{ parent.linkDescription }}

Finding Nth Fibonacci number in Recursive way - C#

Finding Nth Fibonacci number in Recursive way - C#

Like This Article? Read More From DZone

{{ editionName }}

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

{{ parent.tldr }}

{{ parent.linkDescription }}