fibonacci.cpp File Reference

n-th Fibonacci number. More...

#include <cassert>
#include <iostream>

Include dependency graph for fibonacci.cpp:

Namespaces
namespace	math
	for IO operations
namespace	fibonacci
	Functions for Fibonacci sequence.

Functions
uint64_t	math::fibonacci::fibonacci (uint64_t n)
	Function to compute the n-th Fibonacci number.
static void	test ()
	Self-test implementation.
int	main ()
	Main function.

Detailed Description

n-th Fibonacci number.

Naive recursive implementation to calculate the n-th Fibonacci number.

\[\text{fib}(n) = \text{fib}(n-1) + \text{fib}(n-2)\]

See also

fibonacci_large.cpp, fibonacci_fast.cpp, string_fibonacci.cpp

Function Documentation

fibonacci()

uint64_t math::fibonacci::fibonacci

(

uint64_t

n

)

Function to compute the n-th Fibonacci number.

Parameters

n	the index of the Fibonacci number

Returns

n-th element of the Fibonacci's sequence

                               {
    // If the input is 0 or 1 just return the same (Base Case)
    // This will set the first 2 values of the sequence
    if (n <= 1) {
        return n;
    }
 
    // Add the preceding 2 values of the sequence to get next
    return fibonacci(n - 1) + fibonacci(n - 2);
}

main()

int main

(

void

)

Main function.

Returns

0 on exit

           {
    test();  // run self-test implementations
    return 0;
}

Here is the call graph for this function:

test()

static void test ( )

static

Self-test implementation.

Returns

void

                   {
    assert(math::fibonacci::fibonacci(0) == 0);
    assert(math::fibonacci::fibonacci(1) == 1);
    assert(math::fibonacci::fibonacci(2) == 1);
    assert(math::fibonacci::fibonacci(3) == 2);
    assert(math::fibonacci::fibonacci(4) == 3);
    assert(math::fibonacci::fibonacci(15) == 610);
    assert(math::fibonacci::fibonacci(20) == 6765);
    std::cout << "All tests have passed successfully!\n";
}