2015-05-30 22:48:46 +08:00
{
" cells " : [
2015-06-18 04:39:35 +08:00
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
2015-07-05 19:59:00 +08:00
" <small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges).</i></small> "
2015-07-04 08:07:07 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" # Solution Notebook "
2015-06-18 04:39:35 +08:00
]
} ,
2015-05-30 22:48:46 +08:00
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Problem: Implement fibonacci recursively, dynamically, and iteratively. \n " ,
" \n " ,
2015-06-30 17:55:58 +08:00
" * [Constraints](#Constraints) \n " ,
2015-05-30 22:48:46 +08:00
" * [Test Cases](#Test-Cases) \n " ,
" * [Algorithm](#Algorithm) \n " ,
2015-07-01 18:48:04 +08:00
" * [Code](#Code) \n " ,
2015-06-27 18:40:29 +08:00
" * [Unit Test](#Unit-Test) "
2015-05-30 22:48:46 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
2015-06-28 19:13:27 +08:00
" ## Constraints \n " ,
2015-06-27 18:40:29 +08:00
" \n " ,
2015-05-30 22:48:46 +08:00
" * None "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Test Cases \n " ,
" \n " ,
2015-07-01 18:48:04 +08:00
" * n = 0 -> 0 \n " ,
2015-07-08 07:56:21 +08:00
" * n = 1 -> 1 \n " ,
2015-07-01 18:48:04 +08:00
" * n > 1 -> 0, 1, 1, 2, 3, 5, 8, 13, 21, 34... "
2015-05-30 22:48:46 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Algorithm \n " ,
" \n " ,
2015-07-06 17:46:12 +08:00
" Recursive: \n " ,
2015-05-30 22:48:46 +08:00
" * Fibonacci is as follows: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34... \n " ,
" * If n = 0 or 1, return n \n " ,
" * Else return fib(n-1) + fib(n+2) \n " ,
" \n " ,
" Complexity: \n " ,
" * Time: O(2^n) if recursive or iterative, O(n) if dynamic \n " ,
2015-07-01 18:48:04 +08:00
" * Space: O(n) if recursive, O(1) if iterative, O(n) if dynamic "
2015-05-30 22:48:46 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
2015-07-01 18:48:04 +08:00
" ## Code "
2015-05-30 22:52:40 +08:00
]
} ,
2015-05-30 22:48:46 +08:00
{
" cell_type " : " code " ,
2015-06-27 18:40:29 +08:00
" execution_count " : 1 ,
2015-05-30 22:48:46 +08:00
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
" def fib_recursive(n): \n " ,
" if n == 0 or n == 1: \n " ,
" return n \n " ,
" else: \n " ,
2015-06-27 18:40:29 +08:00
" return fib_recursive(n-1) + fib_recursive(n-2) "
]
} ,
2015-05-30 22:48:46 +08:00
{
" cell_type " : " code " ,
2015-06-27 18:40:29 +08:00
" execution_count " : 2 ,
2015-05-30 22:48:46 +08:00
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
2015-06-27 18:40:29 +08:00
" num_items = 10 \n " ,
2015-05-30 22:52:40 +08:00
" cache = [None] * (num_items + 1) \n " ,
2015-05-30 22:48:46 +08:00
" \n " ,
2015-07-12 03:35:34 +08:00
" \n " ,
2015-05-30 22:48:46 +08:00
" def fib_dynamic(n): \n " ,
" if n == 0 or n == 1: \n " ,
" return n \n " ,
" if cache[n] != None: \n " ,
" return cache[n] \n " ,
" cache[n] = fib_dynamic(n-1) + fib_dynamic(n-2) \n " ,
2015-06-27 18:40:29 +08:00
" return cache[n] "
]
} ,
2015-05-30 22:48:46 +08:00
{
" cell_type " : " code " ,
2015-06-27 18:40:29 +08:00
" execution_count " : 3 ,
2015-05-30 22:48:46 +08:00
" metadata " : {
2015-05-30 22:52:40 +08:00
" collapsed " : false
2015-05-30 22:48:46 +08:00
} ,
" outputs " : [ ] ,
" source " : [
" def fib_iterative(n): \n " ,
2015-07-12 03:35:34 +08:00
" a = 0 \n " ,
2015-06-27 18:40:29 +08:00
" b = 1 \n " ,
2015-07-06 18:15:53 +08:00
" for _ in range(n): \n " ,
2015-06-27 18:40:29 +08:00
" a, b = b, a + b \n " ,
" return a "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Unit Test \n " ,
2015-07-04 08:07:07 +08:00
" \n "
2015-06-27 18:40:29 +08:00
]
} ,
{
" cell_type " : " code " ,
" execution_count " : 4 ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [
{
" name " : " stdout " ,
" output_type " : " stream " ,
" text " : [
2015-07-01 18:48:04 +08:00
" Overwriting test_fibonacci.py \n "
2015-06-27 18:40:29 +08:00
]
}
] ,
" source " : [
2015-07-01 18:48:04 +08:00
" %% writefile test_fibonacci.py \n " ,
2015-06-27 18:40:29 +08:00
" from nose.tools import assert_equal \n " ,
" \n " ,
2015-07-01 18:48:04 +08:00
" \n " ,
" class TestFib(object): \n " ,
2015-07-12 03:35:34 +08:00
" \n " ,
2015-06-27 18:40:29 +08:00
" def test_fib(self, func): \n " ,
" result = [] \n " ,
2015-07-06 18:15:53 +08:00
" for i in range(num_items): \n " ,
2015-06-27 18:40:29 +08:00
" result.append(func(i)) \n " ,
" fib_seq = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34] \n " ,
" assert_equal(result, fib_seq) \n " ,
" print( ' Success: test_fib ' ) \n " ,
2015-05-30 22:48:46 +08:00
" \n " ,
2015-07-12 03:35:34 +08:00
" \n " ,
2015-07-01 18:48:04 +08:00
" def main(): \n " ,
" test = TestFib() \n " ,
2015-06-27 18:40:29 +08:00
" test.test_fib(fib_recursive) \n " ,
" test.test_fib(fib_dynamic) \n " ,
2015-07-01 18:48:04 +08:00
" test.test_fib(fib_iterative) \n " ,
" \n " ,
2015-07-12 03:35:34 +08:00
" \n " ,
2015-07-01 18:48:04 +08:00
" if __name__ == ' __main__ ' : \n " ,
" main() "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : 5 ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [
{
" name " : " stdout " ,
" output_type " : " stream " ,
" text " : [
" Success: test_fib \n " ,
" Success: test_fib \n " ,
" Success: test_fib \n "
]
}
] ,
" source " : [
" %r un -i test_fibonacci.py "
2015-05-30 22:48:46 +08:00
]
}
] ,
" metadata " : {
" kernelspec " : {
" display_name " : " Python 2 " ,
" language " : " python " ,
" name " : " python2 "
} ,
" language_info " : {
" codemirror_mode " : {
" name " : " ipython " ,
" version " : 2
} ,
" file_extension " : " .py " ,
" mimetype " : " text/x-python " ,
" name " : " python " ,
" nbconvert_exporter " : " python " ,
" pygments_lexer " : " ipython2 " ,
2015-06-18 04:39:35 +08:00
" version " : " 2.7.10 "
2015-05-30 22:48:46 +08:00
}
} ,
" nbformat " : 4 ,
" nbformat_minor " : 0
}