Recursion Simply Explained with Code Examples - Python for Beginners

In this tutorial, we will talk about recursion and how we can use it to divide and conquer! 💪💪💪
We will also see which is faster - recursive functions or for loops?? we will compare between the two by recreating the Fibonacci Sequence and running a speed test!

⭐Complete Tutorial Code:⭐

Have you already seen my recursion tutorial?? 😜
(I've embraced pvics' joke from the recent community post 😉 hahaha)

***************************
⏰ TIME STAMPS ⏰
***************************
00:00 - Intro
00:15 - What is Recursion
01:03 - Python Recursive Function Code Example
02:43 - Fibonacci Sequence
03:49 - Fibonacci Recursion Code Example
05:21 - Fibonacci Iteration Code Example
06:56 - Is Python Recursion Faster than Iteration?
08:25 - Divide and Conquer
08:48 - Thanks for Watching!
***************************

⭐ My For Loops Tutorial⭐

⭐ My Classes and OOP Tutorial⭐

[maksimslivmanis]

Hey, can you please explain the calculation at 5.20min
Fibonacci(idx-1)+Fibonacci(idx-2), as I understand if our index is 8, then ((8-1)+(8-2)), which equals 13, how did you get 21. I know that the Fibonacci number at index 8 is 21, but I don't understand this from calculation point....
Thank you!

[Justin_White_RUI]

you really have created one of the most high value concise channels on compSCI and python, thank you !

[DarrenRCMS]

If you don't already you should consider doing Udemy courses. Your ability to explain things clearly while also preemptively understanding potential questions and answering them in your trainings is extremely good. Kudos to you!

[PrincessSakuno]

omg that was such a concise and each to understand explanation about recursion! I didn't totally get the fibonacci part but your examples have given me confidence about the basics of writing a recursive function!

[bigdaddy]

Wow your subs have doubled since the last time I checked in. Finally people are seeing the effort and excellent teaching of yours, well done!

[NiceChange]

Fantastic! You made this topic crystal clear and very easy to grasp..thank you

[bytesilver]

I've been watching few of your vids.... very well presented, great content, timings good you will do well as time goes on. I've spotted many youtubers early on sub 10K with now over 500K+. You will be one of those, hitting 100K early 2022 and +300K 2023 if you keep vids coming.

[kapilnayak]

Thanks 🙏, I have been confused for a long time. What a way of explanation with your examples.

[rvm]

Great idea! If all programming tutors were like this, almost all men would be able to program.

[jfrancis]

Thanks! Super awesome tutorials. Helping me to connect dots and feel like I can do this.

[igordc]

I will have to watch this a least one more time to fully comprehend this recursion thing. Great video as

[manusoftar]

it's worth to add that the iterative method is less cpu consumming but is more memmory consuming as you calculate each number until you get the desired one, when in recursion you directly calculate the number you are looking for.

recursion is pretty good to use along with threads, that way you can take a complex operation (something that would require quite a buch of proccesing power or computations and time) and rather than running it all straight forward you divide it in parts and make several threads (that will run concurrently) to compute each part making it way faster.

[southkorea]

Mariya!!! Thankyou so much, I am non CS final year student I tried many videos few days back and I thought to give up learning programming but today I am thorough with this concept through your video, you had really broke it down in a way that I can understand it very easily and clearly, all your videos' are giving me more confidence to learn every topics . Thankyou soo much you are doing a great Job.... Thankyou so much once again.

I'm editing to write this 😉😉 by the way you are beautiful 🤣🤣🤣🤣🤣🤣

[josecintron]

If you want to improve the performance of the fibonacci function or something similar (factorials for example) you may want to use momoization to store previously computed numbers and use them rater than recomputing them.

[trtlphnx]

I Have Been Waiting For This one, sweetie; Love You and This Fantastic Channel ~

[lennon]

It's a fact I didn't know. I'm so thankful.
I hope there will be a day when it can be applied.

[kakairecharles]

Many thanks, You have simplified my life.

[inuwooddog]

Ny most recent use of recursion was to print MLM trees. Basically feeding the deeply nested JSON data into the recursive function.

[ChaosArtist]

Nice video. I was working on solving a Fibonacci algorithm problem recently so it was good to see this video. Nice t-shirt too!

[axelgonzalez]

Thanks for the tutorial. I definitely enjoy your videos because it look like Python is pretty easy to learn and I know sometimes it’s not XD.
You’re amazing!