Fibonacci implementation (TODO)

Author: dmytrostriletskyi

docs/Fibonacci.rst

@@ -0,0 +1,45 @@
+=========
+Fibonacci
+=========
+
+Learning fibonacci implementations in few ways!
+
+Quick Start Guide
+-----------------
+
+.. code-block:: python
+
+    from pygorithm.fibonacci import recursion as fib_recursion
+
+    sequence = fib_recursion.get_sequence(10)
+    print(sequence)  # [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
+
+Features
+--------
+
+* Fibonacci implementations available:
+    - Recursion
+    - Cache (with save results of particular numbers)
+
+* Get the code used for any of the implementation
+
+.. code:: python
+
+    from pygorithm.fibonacci import recursion as fib_recursion
+
+    code = fib_recursion.get_code()
+    print(code)
+
+Implementations API
+-------------------
+
+* Functions and their uses
+
+.. function:: get_sequence(number)
+
+- **number**          : arbitrary integer, that need to be calculated in Fibonacci number type
+- **Return Value**    : return Fibonacci value by specified number as integer
+
+.. function:: get_code()
+
+- **Return Value**    : returns the code for the ``get_sequence()`` function

pygorithm/fibonacci/__init__.py

@@ -0,0 +1,2 @@
+from pygorithm.fibonacci import cache
+from pygorithm.fibonacci import recursion

pygorithm/fibonacci/cache.py

@@ -0,0 +1,37 @@
+"""
+Fibonacci implementation through cache.
+"""
+
+import inspect
+
+
+def get_sequence(n):
+    """
+    Return Fibonacci sequence from zero to specified number.
+    """
+    cache = {0: 0, 1: 1}
+
+    def fib(n):
+        """
+        Return Fibonacci value by specified number as integer.
+        """
+        if n in cache:
+            return cache[n]
+
+        cache[n] = fib(n - 1) + fib(n - 2)
+
+        return cache[n]
+
+    def sequence(n):
+        """
+        Return sequence if Fibonacci values as list.
+        """
+        return [fib(value) for value in range(n + 1)]
+
+    return sequence(n)
+
+def get_code():
+    """
+    Return source code of Fibonacci sequence logic's implementation.
+    """
+    return inspect.getsource(get_sequence)

pygorithm/fibonacci/recursion.py

@@ -0,0 +1,37 @@
+"""
+Fibonacci implementation through recursion.
+"""
+
+import inspect
+
+
+def get_sequence(n):
+    """
+    Return Fibonacci sequence from zero to specified number as list.
+    """
+    def fib(n):
+        """
+        Return Fibonacci value by specified number as integer.
+        """
+        if n == 0:
+            return 0
+
+        if n == 1:
+            return 1
+
+        return fib(n - 1) + fib(n - 2)
+
+    def sequence(n):
+        """
+        Return sequence if Fibonacci values as list.
+        """
+        return [fib(value) for value in range(n + 1)]
+
+    return sequence(n)
+
+
+def get_code():
+    """
+    Return source code of Fibonacci sequence logic's implementation.
+    """
+    return inspect.getsource(get_sequence)

tests/test_fibonacci.py

@@ -0,0 +1,32 @@
+"""
+Test for Fibonacci implementations logic.
+"""
+
+import unittest
+
+from pygorithm.fibonacci import cache, recursion
+
+
+class TestFibonacciImplementations(unittest.TestCase):
+    """
+    Tests for Fibonacci implementations.
+    """
+
+    def test_implementations_same_result(self):
+        """
+        Verify that all implementations have same result.
+        """
+        fibonacci_implementations = [cache, recursion]
+
+        for implementation in fibonacci_implementations:
+            result = getattr(implementation, 'get_sequence')(0)
+            self.assertEqual([0], result)
+
+            result = getattr(implementation, 'get_sequence')(1)
+            self.assertEqual([0, 1], result)
+
+            result = getattr(implementation, 'get_sequence')(10)
+            self.assertEqual([0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55], result)
+
+if __name__ == '__main__':
+    unittest.main()