The recursive fibonacci function. : function recursion « Function « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » Function » function recursion

7.11.4.The recursive fibonacci function.

#include <iostream>

using std::cout;

using std::cin;

using std::endl;



unsigned long fibonacci( unsigned long );



int main()

{

   cout << "fibonacci( 20 ) = " << fibonacci( 20 ) << endl;

   cout << "fibonacci( 30 ) = " << fibonacci( 30 ) << endl;

   cout << "fibonacci( 35 ) = " << fibonacci( 35 ) << endl;

   return 0;

} 



unsigned long fibonacci( unsigned long number )

{

   if ( ( number == 0 ) || ( number == 1 ) )

      return number;

   else 

      return fibonacci( number - 1 ) + fibonacci( number - 2 );

}

fibonacci( 20 ) = 6765
fibonacci( 30 ) = 832040
fibonacci( 35 ) = 9227465

7.11.function recursion
	7.11.1.	Demonstrate recursion
	7.11.2.	Print a string backwards using recursion
	7.11.3.	Recursive factorial function
	7.11.4.	The recursive fibonacci function.
	7.11.5.	The iterative factorial method.

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.