Recursion in Python - the Fibonacci Sequence
Functions in Python have the ability to call themselves. This is what we call a recursion. In this template you will find an implementation of the Fibonacci sequence using recursion. Some other related topics you might be interested in are Recursion in Python - the Fibonacci sequence, The pass-statement in Python, Methods in Python - functions inside classes. The Recursion in Python - the Fibonacci Sequence in Python is among the topics covered in detail in the 365 Program.
Who is it for
This free notebook is for Data Scientists, Data Analysts, Data Architects, Data Engineers, Big Data Architects, Big Data Engineers, BI Developers, Machine Learning Engineers and anyone who wants to master functions in Python.
How it can help you
Tasks such as calculating the Fibonacci sequence could be solved using the Fibonacci sequence. It should be noted though that recursive methods are, in general, significantly slower than iterative ones. Therefore, one should use recursion with caution if they don't want their code running for hours, days, or even years.