Fibonacci Sequence in Python With For Loop, Recursion, Memoization In One Video

In this video, you will learn what the fibonacci sequence is, how to calculate the ith number in the fibonacci sequence. I will also show you how to write a Python program to calculate the ith number in the Fibonacci sequence using the iterative method, recursive method, and memoization method.

What is recursion? Recursion is a function that calls upon itself. Here, we write a function that calls upon itself to binary search an element or value inside an array using a for loop and using recursion. While it is easy to use a for loop or while loop to do this, it is important that you understand these recursion steps to have a strong foundation to learn more complex recursive algorithm in the future.

You use memoization to store the results of previously computed numbers so you don't have to recompute them.

It turns out there is a formula for the Fibonacci sequence as well:
https://www.inchcalculator.com/fibonacci-sequence-calculator/

Proof that the recursive algorithm of the Fibonacci Sequence is O(2^n): https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/

In the next video, I will show you how to use recursion and a for loop to find the least common multiple (lcm) and the greatest common divisor (gcd). This is important when you need to simplify or perform operations with fractions.

LIKE & SUBSCRIBE:
? My Channel: www.youtube.com/c/QuocDatPhung
? My second channel: https://www.youtube.com/channel/UCtgROmYhSv97aE11LMiB7yg