      "            total = n_minus_2 + n_minus_1\n",
      "            n_minus_2, n_minus_1 = n_minus_1, total\n",
      "        return total\n",
      "\n",
      "for i in xrange(0, 10):\n",
      "    print(fib_iterative(i))"
     ]
    }
   ],
   "metadata": {
 
</s> remove     "for i in xrange(0, 10):\n",
 </s> add     "for i in xrange(0, num_items):\n", </s> remove     "for i in xrange(0, 10):\n",
 </s> add     "for i in xrange(0, num_items):\n", </s> remove     "        return fib(n-1) + fib(n-2)\n",
 </s> add     "        return fib_recursive(n-1) + fib_recursive(n-2)\n", </s> remove     "n = 7\n",
    "cache = [None] * (n + 1)\n",
 </s> add     "cache = [None] * (num_items + 1)\n",
    "for i in xrange(0, num_items):\n",
      "            total = n_minus_2 + n_minus_1\n",
      "            n_minus_2, n_minus_1 = n_minus_1, total\n",
      "        return total\n",
      "\n",
    "for i in xrange(0, num_items):\n",
      "    print(fib_iterative(i))"
     ]
    }
   ],
   "metadata": {
keep keep keep keep replace keep keep keep keep keep
 Fixed fib function errors not initially caught from cached values in the IPython kernel.  Code cleanup. 
recursion-dynamic/fibonacci.ipynb