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: www.youtube.com/watch?v=bY6m6_IIN94&list=PLi01XoE8jYohWFPpC17Z-wWhPOSuh8Er-

********
Subscribe today! www.youtube.com/subscription_center?add_user=SocraticaStudios

Follow us on Twitter @socratica
Like us on Facebook @SocraticaStudios

********
Python Lists - Learn Python Programming (Computer Science)
Python instructor: Ulka Simone Mohanty
Written & Produced by Michael Harrison

1. Learn Python Programming with Socratica
2. Python Hello World
3. Python Strings
4. Numbers in Version 2
5. Numbers in Version 3
6. Arithmetic in Python V2
7. Arithmetic in Python V3
8. Interactive Help
9. Python Booleans
10. Datetime Module (Dates and Times)
11. Python: If, Then, Else
12. Python Functions
13. Sets in Python
14. Python Lists
15. Python Dictionaries
16. Python Tuples
17. Recursion, the Fibonacci Sequence and Memoization
18. Python Random Number Generator: the Random Module
19. CSV Files in Python
20. A Random Walk & Monte Carlo Simulation
21. List Comprehension in Python

Our Python Tutorials will help you learn Python quickly and thoroughly. We start with "Hello World" and then move on to data structures (sets, lists, tuples and dictionaries). Next we'll cover classes, and give a variety of in-depth examples and applications.

Python is a clean and powerful programming language. You can use it to build websites, analyze data, write utilities, and create many other kinds of software. In this series we will teach everything you need to know to begin writing your own code in Python.