def fib_recursive(n):
<EOL>assert n >= <NUM_LIT:0>, '<STR_LIT>'<EOL>if n <= <NUM_LIT:1>:<EOL><INDENT>return n<EOL><DEDENT>else:<EOL><INDENT>return fib_recursive(n-<NUM_LIT:1>) + fib_recursive(n-<NUM_LIT:2>)<EOL><DEDENT>
[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]