(n)
[summary]
    Computes the n-th fibonacci number recursive.
    Problem: This implementation is very slow.
    approximate O(2^n)

    Arguments:
        n {[int]} -- [description]
    
    Returns:
        [int] -- [description]
[summary]
    Computes the n-th fibonacci number recursive.
    Problem: This implementation is very slow.
    approximate O(2^n)
[ summary ] Computes the n - th fibonacci number recursive . Problem : This implementation is very slow . approximate O ( 2^n )
def fib_recursive(n):
    """[summary]
    Computes the n-th fibonacci number recursive.
    Problem: This implementation is very slow.
    approximate O(2^n)

    Arguments:
        n {[int]} -- [description]
    
    Returns:
        [int] -- [description]
    """

    # precondition
    assert n >= 0, 'n must be a positive integer'

    if n <= 1:
        return n
    else:
        return fib_recursive(n-1) + fib_recursive(n-2)
def fib_recursive ( n ) : # precondition assert n >= 0 , 'n must be a positive integer' if n <= 1 : return n else : return fib_recursive ( n - 1 ) + fib_recursive ( n - 2 )