I love that you used the debugger. It’s such a powerful yet typically underutilized tool that we have at our disposal.

I just want to thank you for your videos that I watch from time to time. I'm kind of "specialized" in Laravel but I like the fact that you explain very well, and that it can apply to any language.

Can I please request you use dark mode on Excalidraw, the contrast from your editor to the excalidraw hurt my eyes lol

Hey, man. That was awesome. I loved how simple and yet how deeply this video was.

First attempt to learn resursion. Your exaplanation is clean and clear. It must be helping a lot for a deeper study of recusion!

Nice work, Cody. Tree structure definitely a good way to explain

Thanks a lot, it's starting to make sense now. It's actually just a loop written differently when you think about it

Thank you for your examples and explanations

Great explanation, especially if you knew it but need a refresher

Great video, please do more Vanilla Javascript videos. you're a great teacher.

This really helped me learn

I rarely find recursion useful outside of traversing trees, in which case it's a great approach. Loop through objects, if it has children (or a parent if traversing in that direction) then you just keep traversing until you find what you want, or until you achieve the desired result. I also use recursion for some maze algorithms I made, but those aren't too dissimilar to trees. It's a node based system at the very least, where each node has siblings.

Your channel is 💎 to me.

finally, I understand it. thank you bro XD

any way you could do a video with that last permutation exercise? that's exactly what I am looking to learn.

im still a little bit confused. how does the function know to add all of the results of the recursive function up to create the result when its not state in the function at any point ?

Tower of Hanoi is the real ball buster

I've been doing a few challenges from the "type-challenges" repo on github every day (treating it like a daily wordle puzzle) and it's forced me to get comfortable at recursion. That said, the lack of ability to debug a typescript function isn't great for learning. Also the challenges on that repo could be arranged in a better order. Some of its early stuff isn't exactly "easy" and some require really weird tricks which are nice to learn but can result in you wasting a lot of time if you try to do it yourself without looking at the solution.

Good job love ❤️

Good Tutorial

I understand the concept of recursion perfectly, but I have no idea how to implement it. It's so mindbending trying to figure out what each step is accomplishing in the recursive body, and it just makes me want to rip my hair out.

Or u can use reduce function and using it as tail recursion.

I was unable to see contents of call stack in chrome browser, can you help? I followed your steps, still it did not work.

i get why fib 2 + fib 1 is fib 3, but i don't get why fib 3 + fib 2 is fib 4 :P. Can some one explain me this little detail?

Vous aviez raison de dire que le factoriel peut être un cas d'utilisation de la récursivité.

The first element in Fibonacci series is 0!!! Great tutorial tho

I feel like this took a confusing topic and somehow managed to make it more confusing.

it was amazing until the fibonacci example where it felt a bit convoluted and it was kinda complicated to follow the callback stack and the explanation. just my $0.02

if this guy actually spends time to organize his explanations, he would be the best, no doubt! thanks, but in many points of the vid, you literally distracted me by making some mistakes, that were just caused by the fact that you explain on LIVE, or idk. but yeah, take that into consideration :) thank uuu for the explanations tho !!