Fibonacci Recursive and Non Recursive C++

Aescleal

Rate me:

5.00/5 (2 votes)

20 Sep 2010CPOL3 min read

10.7K

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 -...

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++

14 Sep 2010ostream

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

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

Aescleal

Software Developer (Senior)

United Kingdom

I've been programming since 1985 - starting with Fortran 77, then moving onto assembler, C and C++ in about 1991. I also know enough Java and Python to read code but you probably wouldn't want me writing it.

I've worked in a wide variety of application areas - defense, banking, games and security with the longest stints being in security. I also seem to end up programming devices far too often. This time I'm programming terahertz band body scanners.

Fibonacci Recursive and Non Recursive C++

Alternatives

License

Comments and Discussions