@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!
@GiasoneP
I was head faked, I totally thought recursion was going to win 😂 thanks for the explanation
@ardiahmed822
Probably the most engaged I've been while watching a programming tutorial, haha! Cheers, even though I'm 3 years late.
@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!
@ajm7318
Was this kind of confusing for anyone else or am I dumb
@joseluisbrear.5196
I love the way you explain, as a matter of fact, I subscribed to your channel.
@Zack-zz5kz
Thank you for this explanation. I got to know more on recursion not just from the vid but also the comments u answered.
@mathewmcfool
I need that voice, I want my navigation, Siri, audiobooks and therapists to have that voice
@lennon4044
It's a fact I didn't know. I'm so thankful. I hope there will be a day when it can be applied.
@igordc16
I will have to watch this a least one more time to fully comprehend this recursion thing. Great video as always!!!!!!!!!!!!
@longjunior7638
Best teacher in the world hand down
@FalconFlyer75
I love the visual aids, I really makes a world of difference
@eyal4
Having fun while learning python and programming. The best teacher 🙂
@NewUnit13
def tail_rec_fibonacci(idx, a=0, b=1):
if idx == 0:
return a
return tail_rec_fibonacci(idx-1, b, a+b)
@sentinel5943
Can't believe just when i search for recursion you just happen to upload a video 5 hours ago Hahaha, great vid! thanks as always great content. :D
@SerrvantX
I am taking the Coursera course and you explain things way better than the instructor on there
@thunder____
I've been seeing your videos pop up on my feed quite a bit lately, and this is my first time watching one, and I have a mix of compliments and criticisms. First, the compliments. Your presentation skills are quite good; you speak clearly, confidently, and concisely, as opposed to a number of other creators who tend to ramble a bit and then fail to edit those ramblings out. Your editing is also quite visually engaging, and it supports the points you're making quite well. However, I can't overstate what a massive L take it is to come to the blanket conclusion, based on a single test comparing two functions that are written very differently from each other, that iteration is faster than recursion. Even ignoring the fact that the functions are written so differently, a single test using only a single input is not very illuminating; you would need to run each function with a variety of inputs, and do multiple tests, in order to come to any kind of conclusion. But let's come back to the fact that the functions are written so differently from each other, because a brief examination makes it obvious that the recursive example is extremely disadvantaged because it has to run far more computations because it's doubly recursive, meaning it calls itself twice at the end of each call, so that's at least twice as much computation right there. This is in stark contrast to the iterative example, which holds previously computed values in a list, which takes a massive load off the CPU at the expense of some RAM, and that RAM cost might get significant when called with a large index (though in practice, a list of integers is quite unlikely to cause memory issues; this would be a bigger concern when holding a list of more complex objects) but in the example shown here, the iterative example is at a huge advantage, which is definitely majorly skewing the results of your test. Also, my understanding is that time.perfcounter() is better to use for measuring performance than time.time(). I don't know why that is, but that's the advice I've always heard. On a much less serious note, I'm simply SHOCKED and APPALLED at your use of PascalCase for a function name.
@southkorea1952
Awesomeeeeeeee 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 🤣🤣🤣🤣🤣🤣
@josecintron85
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.
@maksimslivmanis5283