def fib_list(n):
<EOL>assert n >= <NUM_LIT:0>, '<STR_LIT>'<EOL>list_results = [<NUM_LIT:0>, <NUM_LIT:1>]<EOL>for i in range(<NUM_LIT:2>, n+<NUM_LIT:1>):<EOL><INDENT>list_results.append(list_results[i-<NUM_LIT:1>] + list_results[i-<NUM_LIT:2>])<EOL><DEDENT>return list_results[n]<EOL>
[summary]
    This algorithm computes the n-th fibbonacci number
    very quick. approximate O(n)
    The algorithm use dynamic programming.

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

    Returns:
        [int] -- [description]