Programming Help

Web Development

Projects



What's Here?

  • Members: 86,467
  • Replies: 356,991
  • Topics: 52,381
  • Snippets: 1,779
  • Tutorials: 425
  • Total Online: 1,284
  • Members: 44
  • Guests: 1,240

Who's Online?
 

Code Snippets

  

C++ Source Code
Welcome to Dream.In.Code
Getting C++ Help is Easy!

Join 86,467 C++ Programmers. There are 1,284 online right now! Ask your question and get quick answers from Dream.In.Code experts. Join the #1 programming help community on the internet! Registration is fast and FREE... Join Now!

Chat LIVE With a C++ Expert
Powered by LivePerson.com

Register to Make This Box Go Away!


Recursive Fibonacci Sequence

This code shows how to generate a Fibonacci Sequence using Recursion.

Submitted By: born2c0de
Actions:
Rating:
Views: 28,260

Language: C++
Last Modified: March 2, 2005

Snippet


  1. long fib(unsigned long n) {
  2.     if (n <= 1) {
  3.         return n;
  4.     } else {
  5.         return fib(n-1)+fib(n-2);
  6.     }
  7. }

Copy & Paste

Comments


mahir 2007-11-15 07:47:24

where is header file
born2c0de 2008-01-18 04:00:07

This function does not require a header file. Besides, it is a code snippet and not a complete application. You will have to call it from main() or any other function to use it.
giotto 2008-02-04 08:59:49

Oh, come on! It can be done, in one line! int fibonacci(int number){ return number
giotto 2008-02-04 09:00:20

int fibonacci(int number){ return number
giotto 2008-02-04 09:00:49

:S
nurboja 2008-05-03 03:07:39

int fib(int x) { if (x==0) return 0; else if (x==1) return 1; else return fib(x-1)+fib(x-2); }
nurboja 2008-05-03 03:08:04

Fn=0 za n= 0; Fn=1 za n= 1; Fn=Fn–1+ Fn–2 za n>=2;


Add comment


You must be registered and logged on to </dream.in.code> to leave comments.





Live C++ Help!

C++ Tutorials

Reference Sheets

C++ Snippets

Bye Bye Ads

Free DIC T-Shirt

T-Shirt Example

Related Sites

Monthly Drawing

Thumb Drive

Partners

Top Contributors

Top 10 Kudos This Month