ไม่สามารถเล่นวิดีโอนี้
ขออภัยในความไม่สะดวก
Recursion in 100 Seconds
ฝัง
- เผยแพร่เมื่อ 29 ธ.ค. 2019
- Learn how recursion ♾️works in 100 seconds. fireship.io
#compsci #100SecondsOfCode
Install the quiz app 🤓
iOS itunes.apple.com/us/app/fires...
Android play.google.com/store/apps/de...
Upgrade to Fireship PRO at fireship.io/pro
Use code lORhwXd2 for 25% off your first payment.
My VS Code Theme
- Atom One Dark
- vscode-icons
- Fira Code Font
To understand recursion you need to understand recursion.
But for that you need to understand recursion which means you should know recursion
which results in you having to understand recursion to know recursion
Recursion understand to need you recursion understand to.
That's a stupid saying. If that's true, then nobody would have learned recursion.
@@kingofyoutube9318 uhhh is this serious?
I was expecting the start of the video at the end 😔
that's creative
th-cam.com/video/xeMcWN_5qK4/w-d-xo.html
This is awesome!! Clear all your doubts about Recursion and master it in just 15 minutes!!
Watch now!!
To really understand recursion, you must first understand recursion.
Our Lord has spoken
Wow there was a comment a month before this comment thats very very similar but got less likes.
Yes but how do I learn
Oh it's recurring
ok
Ok
Ok
Ok
Ok
Ok
Ok
Ok
Ok
Ok
Ok
and recursive himself
th-cam.com/video/xeMcWN_5qK4/w-d-xo.html
This is awesome!! Clear all your doubts about Recursion and master it in just 15 minutes!!
Watch now!!
Nice video! But you made a mistake in your time complexity analysis. The recursive solution will take O(2^N), not O(N^2). There is a huge difference: O(N^2) means the complexity is bounded by a polynomial function, whereas O(2^N) means the complexity is bounded by an exponential function. These two functions belong to two different classes and their practical implication is quite significant.
nice insight 👍
@@farhanaditya2647 you've got an interesting name.
The time complexity is actually O(1.618…^n). 1.618… being the golden ratio.
Ironically, the runtime complexity of this approach is the Fibonacci sequence itself
@Fireship
I love those 100 sec videos, somehow those simple explanations are more clear than overcomplicating
th-cam.com/video/xeMcWN_5qK4/w-d-xo.html
This is awesome!! Clear all your doubts about Recursion and master it in just 15 minutes!!
Watch now!!
Might just be me and that i'm further down my career than others, but i'm kind of tired of recursion being explained by using the fib example. I think the community should come up with some real world examples like traversing a tree and why that is important
Point taken. I've used recursion in some real-world examples in past videos. It's hard to find minimal examples that don't get bogged down with other implementation details.
And its also bad because its insanely unoptimal
my friend he tried to explain simply in 100 seconds....understand the purpose of the video
@@adastraperlana oh I know just every computer science course and every tutorial out there that talks about recursion uses fib as an example. I'm just saying in general I think we need to come up with a better example
In web design: creating breadcrumbs is a good, simple example for when to use recursion (depending on the CMS, I suppose).
The production of these videos is pure art. Really makes the concepts easy to grasp.
The dream analogy is too good. I've been searching for a better analogy than factorials. Thank you. I'm really grateful.
damn this 100s of [stuff] series is really good to get a grasp of things, keep it going!
th-cam.com/video/xeMcWN_5qK4/w-d-xo.html
This is awesome!! Clear all your doubts about Recursion and master it in just 15 minutes!!
Watch now!!
I love these in 100 seconds videos, please keep em coming!! 📚
Your video representation, background music, and the way u explain is awesome man👏👍
O(n^2)? maybe O(2^n). Good video anyway
Yeah, I was going to say the same thing. You can the recursive fib to O(n) with dynamic programming but his implementation in the video is O(2^n)
stackoverflow.com/questions/360748/computational-complexity-of-fibonacci-sequence
Θ(φ^n)
Good call, you'r right.
@@Fireship free tshirt?
What a coincidence! Writing a recursive method for the Fibonacci sequence was an interview question I once had and I thought it was really good to test recursion knowledge. Great video
These short and sweet clips are the reason I subscribed.
Glad to hear that! Many more on the way :)
th-cam.com/video/xeMcWN_5qK4/w-d-xo.html
This is awesome!! Clear all your doubts about Recursion and master it in just 15 minutes!!
Watch now!!
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.
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).
th-cam.com/video/xeMcWN_5qK4/w-d-xo.html
This is awesome!! Clear all your doubts about Recursion and master it in just 15 minutes!!
Watch now!!
The animations in this one were extra complimentary
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.
It is not... Some problems can only be solved by recursion, recursion is fundamentally different to loops, can certainly be used as loops tho...
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
Great Video!! Quick and Easy explanation..
Thank You So Much for this wonderful video........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
this guy actually makes programming look fun
Finally a 100 second video of actually 100 seconds
Great video as usual :)
The quality of your explanations has come a long way
Your videos make programming cool 😎
by the time I settled down to watch the video, he said "thank you for watching"
You forgot to mention that in your example of dream function all recursion calls are tail calls, so the stack would never overflow with optimized compiler because we can omit pushing next ret instruction address and jump instead.
But some languages like JS and Python don't use tail-call elimination, because they want to make debugging stack traces easier. That's why my bigint implementation of the Ackermann function uses explicit TC elimination, by converting the double recursive call, into a single call performed in a conditional loop
th-cam.com/video/xeMcWN_5qK4/w-d-xo.html
This is awesome!! Clear all your doubts about Recursion and master it in just 15 minutes!!
Watch now!!
psyched for memoization!
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
It's also worth to mention a tail-call optimization. It allows to avoid stack overflow for bigger recursions ;)
Unfortunalty not many languages have this optimization ;-;.
How would that work for monadic recursion?
i wonder tail-call optimization works under the hood
th-cam.com/video/xeMcWN_5qK4/w-d-xo.html
This is awesome!! Clear all your doubts about Recursion and master it in just 15 minutes!!
Watch now!!
Looking forward to part 3: dynamic programming
This is basically the MIT recursion lecture but as a summary. Wish I came here first would have saved some time
I'm more confused 🥳🥳really nice video
Just right now I was struggling with this topic.
I love these videos too. Who did the music for this? 🔥🛸
well, a nice way to calculate Fibonacci numbers is, using power of matrix. that has a complexity of O(logN)
I have learnt a lot of new things that I have never worked with from your videos, like AWS, nginx, kubernetes, graphQL(and other dbs), typescript to name a few. One thing that I don't understand is how they work together. I would really love to see a video where you design a mock system using all of these (and possibly more) and explain each of their roles and why you chose it (kinda like your reverse-cloud migration video using raspberry pi).
Whenever I think of a software architecture I think of them as several layers that interact with each other. However, I am unable to assign which layer what belongs to by watching a stand alone tutorial about a single tool.
Btw, I am a college senior pursuing CS major and I love your content. Thanks for all the awesome contents.
where's de Memoization video :"(
Where is it 😂
Hi! Cool idea! But be careful, that implementation of recursive fib is not n^2 and not even 2^n but it's phi^n. With memorization you can make it linear and with matrix powers you can make it logarithmic.
But only in time complexity. regarding to memory complexity your suggested algorithms are actually worse - which is a tradeoff often neglected. Still I would prefer your methods :)
@@SirM0linarius Memoization is O(1) in memory complexity, O(n) time complexity. (You can save an array of O(N) elements if you want, but that's only helpful if you want to calculate the numbers multiple times)
@@marcogoncalves1073 Other way around.
@@Vaaaaadim What do you mean? You literally only keep in memory the last 2 elements that were calculated.
@@marcogoncalves1073 As I understand, memoization is a top-down approach, and would cache results of function calls.
Dynamic programming, is a bottom-up approach. The approach to computing fibonnaci numbers involving the continual update of a pair of fibonnaci numbers... is a bottom-up approach and hence dynamic programming rather than memoization.
First 100 seconds video I'm seeing on this channel that's really 100 seconds by mathematical standards
Waiting for your next video on memoization...
still waiting...
As some dude once said;
“In order to understand recursion, one must first understand recursion.”
The implementation in the video has exponential complexity and not O(N^2). Correct me if I am wrong.
Yeah you're right. The time complexity is O(2^N)
Fireship please dont stop ever!
did you upload the video on memorization you mentioned? i can't find it.
No, he did not.
Here is next best thing with simple explanation
Recursion, the Fibonacci Sequence and Memoization || Python Tutorial || Learn Python Programming
th-cam.com/video/Qk0zUZW-U_M/w-d-xo.html
This is lovely...I already shared to twitter 🔥
The future of Binance: an exclusive interview with the CEO
Recursion might be a confusing topic to some. It's really just about repetition. It doesn't really come up as a solution very often, but it happens. You just get used to recognizing situations where it makes a lot of sense. It's not the only way to solve such problems, and it's usually not associated with good performance, but it's elegant.
I usually find a recursive solution almost instantly and then implement it iteratively or with higher order collection methods because of efficiency. Once you get the hang of it, recursion is conceptually really easier
Jeff is still my favourite tech youtuber
Good, now we have 10 functions and lets do recursion with those!
Ayyy niceuuu
Your guide to success: refund details and anticipated actions
it's O(2^n) not O(n^2).
Oh yes!!! Dynamic programming
Great!
This is the best channel on TH-cam. Like, ever.
No u
Im learning a lot in 100 seconds.
I didn't understand the background, invisible stuff - the stuff that was happening on the stack. That's why recursion looks so strange. It's difficult to visualize what you don't know about.
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.
th-cam.com/video/xeMcWN_5qK4/w-d-xo.html
This is awesome!! Clear all your doubts about Recursion and master it in just 15 minutes!!
Watch now!!
Nah, recursion is fine for various problems. Normally parsers and compillers use them a lot
I just noticed, the logo which you use is really similar to the logo of freecodecamp.org, is this TH-cam channel associated with freecodecamp in any way ?
I loved the simple explanation provided in this video ! 👍
Awww shieeeet 0:30 wokies, being NPCs, can't dream. 💕 it!
I think, there is one mistake in function you've written for fib sequence, you should return targetIndex in the base case not 1.
Recursion is like Newton's first law of motion
honestly I could use a 1000 second video on this topic
Him: "index 2023"
Me: WHAT how did he know?!
Does the memoization video still exist, i cant find it anywhere. Might be nice to put a link to videos you mention in the description.
Everything is connected 😮
As someone who is currently in a year index of 2023, I agree with this.
I dare you to explain monads in 100 seconds.
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.
Nice
I feel like recursion is not a topic which can be properly explained in just 100s.
array map and reduce were good, but this is much more complex
Recursion is when a function calls itself. there that didn't even take more than 5 sec.
jibes aside, recursion is a very simple concept, but its hard for people to get their heads arround it. like some people coming in from procedural languages have a really bad time understanding JS's async code, i.e Callbacks and Promises. Thankfully Async Await is pretty much bridged that gap.
1:20 TC will be 2^n if I am not wrong
1:20 No, this is exponential time, not quadratic time. O(2^n) -- NOT O(n^2)
I can't believe there is not a link to this video in the description
It is programming equivalent of Inception.
cool
Oh. I saw that CS in the thumbnail and misread it as CSS. I was wondering how CSS could be recursive.
brooo...where's the memoization video
Still waiting for that memoization video
how's the background song called?
I can't find the memoization video!
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
Memoization?
Can someone explain:
const sequence = [0n, 1n];
what do 0n and 1n mean?
Those are bigint literals
This channel makes me realize how shit I am on JS.
where is the memorization video
Did the memoization happen?
Where is Memoization video.
Please upload.
0:14 me a cpp and c coder:thats a problem of the future
Use void functions!
You know what they say, to understand recursion, you first need to understand that the real recursion were the friends we made along the way
I'm still waiting for the memoization video 2 years later
1:18 O(N^2)? No it isn't, it's at least exponential, and no more than O(2^N). Also "O to the N^2"? --> "O of ..."
I have never seen a good use of recursion. They are hard to debug and they are cryptic to understand. Trees usually have a limited nr of levels.
Huh. Did that memoisation video ever get made?
Is recursion helpful in solving majority of the chess problems?
Oh no, memoization is still not out :( (if I searched correctly)
Behind the scenes: Binance CEO shares insights into future developments in an exclusive interview
I get stuck on a recursive loop when I start thinking about lunch. How do I return out of the loop???
you don't, you eat lunch