Video is ready, Click Here to View ×


Let’s explore recursion by writing a function to generate the terms of the Fibonacci sequence. We will use a technique called “memoization” to make the function fast. We’ll first implement our own caching, but then we will use Python’s builtin memoization tool: the lru_cache decorator.

➢➢➢➢➢➢➢➢➢➢
To learn Python, you can watch our playlist from the beginning: https://www.youtube.com/watch?v=bY6m6_IIN94&list=PLi01XoE8jYohWFPpC17Z-wWhPOSuh8Er-

➢➢➢➢➢➢➢➢➢➢
We recommend:
Python Cookbook, Third edition from O’Reilly
http://amzn.to/2sCNYlZ

Shop Amazon Used Textbooks – Save up to 90%
http://amzn.to/2pllk4B

➢➢➢➢➢➢➢➢➢➢
Subscribe to Socratica: http://bit.ly/1ixuu9W

To support more videos from Socratica, visit
Socratica Patreon
https://www.patreon.com/socratica

Socratica Paypal
https://www.paypal.me/socratica

We also accept Bitcoin! 🙂
Our address is: 1EttYyGwJmpy9bLY2UcmEqMJuBfaZ1HdG9

➢➢➢➢➢➢➢➢➢➢
Python instructor: Ulka Simone Mohanty
Written & Produced by Michael Harrison
FX by Andriy Kostyuk