dynamic_programming.fast_fibonacci
==================================

.. py:module:: dynamic_programming.fast_fibonacci

.. autoapi-nested-parse::

   This program calculates the nth Fibonacci number in O(log(n)).
   It's possible to calculate F(1_000_000) in less than a second.



Attributes
----------

.. autoapisummary::

   dynamic_programming.fast_fibonacci.n


Functions
---------

.. autoapisummary::

   dynamic_programming.fast_fibonacci._fib
   dynamic_programming.fast_fibonacci.fibonacci


Module Contents
---------------

.. py:function:: _fib(n: int) -> tuple[int, int]

.. py:function:: fibonacci(n: int) -> int

   return F(n)
   >>> [fibonacci(i) for i in range(13)]
   [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144]


.. py:data:: n