Recursion in 100 Seconds

Recursion is like Newton's first law of motion

The dream analogy is too good. I've been searching for a better analogy than factorials. Thank you. I'm really grateful.

Every time I am told to do recursion, I shrivel up because how does something call itself. Wouldn't it go into a loop? Wouldn't n never approach the end of the array and instead approach infinity because it just keeps looking again and again. I am so dumb, but idk how I've made it this far by avoiding recursion.

honestly I could use a 1000 second video on this topic

damn

As some dude once said;

“In order to understand recursion, one must first understand recursion.”

I think, there is one mistake in function you've written for fib sequence, you should return targetIndex in the base case not 1.

cool

I love these videos too. Who did the music for this? 🔥🛸

did you upload the video on memorization you mentioned? i can't find it.

As someone who is currently in a year index of 2023, I agree with this.

From 2023 hello world 🌍

this guy actually makes programming look fun

My second sentence is false. My first sentence is true.

Which sentence is True?

Where is Memoization video.
Please upload.

where is the memorization video

Him: "index 2023"
Me: WHAT how did he know?!

I watched this at 1.25 speed

has the memoization fireship video been made yet? I can't seem to find the video. I have other videos to reference for memoization but I like these types of videos for a brief rundown if I ever need a quick refresher

Bootstrap paradox

Array.reduce…

After my confirmation, I will buy a gaming pc. Then I'm going to make a program with a recursive function and wait until it used up all 16GB of RAM

What a missed opportunity to put at the end "If you want to learn more about recursion, please see Recursion in 100 seconds" :c

Can someone explain how that recursive fibonacci function works? 😰😰

I love these in 100 seconds videos, please keep em coming!! 📚

Recursion as an alternate way to write loops. Thanks for mentioning this early on, because the concept is a big gotcha when people learn functional programming.

I think that also talking a bit about the tail call recursion would be nice, since for the fibannaci problem it can make things significantly better with a time complexity of O(n) and auxiliary space of O(n).

It is programming equivalent of Inception.

I can't believe there is not a link to this video in the description

Recursive functions and binary trees were one of my favorite topics while learning programming. It's really fun to marvel at how the logic works.

well, a nice way to calculate Fibonacci numbers is, using power of matrix. that has a complexity of O(logN)

Actually you want to avoid recursion. The point is, you can have recursion without noticing it, when several functions call each other in a circle. And if there is a stopping condition, it is hard to tell what exactly the stopping condition is.

Memoization 👍🏻

.

if (!woke)

him: optimize fibonacci with memoization
me:
((1+sqrt(5))^n-(1-sqrt(5))^n)/(sqrt(5)*2^n)

Recursion in 100 seconds in 100 seconds in 100 seconds 100 seconds in 100 seconds in 100 seconds 100 seconds in 100 seconds in 100 seconds 100 seconds in 100 seconds in 100 seconds (etc)

First 100 seconds video I'm seeing on this channel that's really 100 seconds by mathematical standards

Good, now we have 10 functions and lets do recursion with those!

Nice

Oh. I saw that CS in the thumbnail and misread it as CSS. I was wondering how CSS could be recursive.

I'm still waiting for the memoization video 2 years later

Huh. Did that memoisation video ever get made?

Well it depends on the language implementation, in lisp iteration and recursion are the same thing and you don't have to warry about maximum recursion depth

Ayyy niceuuu

can someone ive me the name of the song plz?