Fibonacci Recursive and Non Recursive C++

ostream

Rate me:

5.00/5 (1 vote)

14 Sep 2010CPOL

5.5K

A stupid change :) int FibonacciR::Fibonacci(const int &n){ if(n<=1) return n; return Fibonacci(n-1) + Fibonacci(n-2); } :laugh:

Alternatives

Members may post updates or alternatives to this current article in order to show different approaches or add new features.

1. Fibonacci Recursive and Non Recursive C++

20 Sep 2010Aescleal

If you can, the quickest way to calculate the Fibonacci numbers is to do it at compile time. This is a case of "My recursive method is quicker than yours...":templateclass fibonacci_number{ public: static const T value = fibonacci_number<T, n -...

C++

Linux

2. Fibonacci Recursive and Non Recursive C++

18 Sep 2010joseph.arul83@gmail.com

2 alternatives

Non Recursive and Recursive implementation of Fibonaci series in C++. Emphasis is on the complexity involved in the different implementations.

C++

Linux

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

ostream

Afghanistan

This member has not yet provided a Biography. Assume it's interesting and varied, and probably something to do with programming.

Fibonacci Recursive and Non Recursive C++

Alternatives

License

Comments and Discussions