Recursion in 100 Seconds

Video quality	The size	Download

Информация о Recursion in 100 Seconds

Название	:	Recursion in 100 Seconds
Продолжительность	:	1.40
Дата публикации	:
Просмотров	:	238 rb

Recursion is like Newton's first law of motion
Comment from : Wasim

The dream analogy is too good I've been searching for a better analogy than factorials Thank you I'm really grateful
Comment from : Franklin Nwokoma

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
Comment from : MoguMogu

honestly I could use a 1000 second video on this topic
Comment from : Maksym Zakharzhevskiy

damn
Comment from : Scotty9inches

As some dude once said;brbr“In order to understand recursion, one must first understand recursion”
Comment from : Digital Diamond

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

cool
Comment from : genta

I love these videos too Who did the music for this? 🔥🛸
Comment from : White Noise Focus

did you upload the video on memorization you mentioned? i can't find it
Comment from : Name

As someone who is currently in a year index of 2023, I agree with this
Comment from : Scott Bisco

From 2023 hello world 🌍
Comment from : Hstivggf ghyhgfg

this guy actually makes programming look fun
Comment from : Alien Xxvi

My second sentence is false My first sentence is truebrbrWhich sentence is True?
Comment from : Ertuğrul Çukuryurt

Him: "index 2023"brMe: WHAT how did he know?!
Comment from : Pi Launchpad

I watched this at 125 speed
Comment from : Fredrik

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
Comment from : Not Given

Bootstrap paradox
Comment from : Sibusiso Buthelezi

Awww shieeeet 0:30 wokies, being NPCs, can't dream 💕 it!
Comment from : Christoph Rackwitz

Arrayreduce…
Comment from : winson leow

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

Can someone explain how that recursive fibonacci function works? 😰😰
Comment from : Rioze

I love these in 100 seconds videos, please keep em coming!! 📚
Comment from : feelgood_cinematic

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
Comment from : Misra Aditya

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)
Comment from : j3y

It is programming equivalent of Inception
Comment from : Indian

I can't believe there is not a link to this video in the description
Comment from : Yerson Lasso

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
Comment from : nochtczar

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

1:20 No, this is exponential time, not quadratic time O(2^n) -- NOT O(n^2)
Comment from : Astral-chan

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
Comment from : InspektorDreyfus

Memoization 👍🏻
Comment from : Matheus Costa

Comment from : Saikat Karmakar

if (!woke)
Comment from : Nithin Sai

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)
Comment from : BaBomba Gaming

First 100 seconds video I'm seeing on this channel that's really 100 seconds by mathematical standards
Comment from : Precious Aleaji

Good, now we have 10 functions and lets do recursion with those!
Comment from : Phantom Blox

Nice
Comment from : Monika

Oh I saw that CS in the thumbnail and misread it as CSS I was wondering how CSS could be recursive
Comment from : ZipplyZane

I'm still waiting for the memoization video 2 years later
Comment from : kklowd

Huh Did that memoisation video ever get made?
Comment from : Ludwig

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
Comment from : M B

Ayyy niceuuu
Comment from : Low Level Learning

can someone ive me the name of the song plz?
Comment from : TheShadow

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 "
Comment from : Vadim

For anyone who is still confused this video explains it better youtube/rf60MejMz3E
Comment from : Someoneyeeted

Still waiting for that memoization video
Comment from : Hyperspeed1313

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
Comment from : Dreami Sover

Finally a 100 second video of actually 100 seconds
Comment from : Andro developer

Im learning a lot in 100 seconds
Comment from : Sam Adrian P Sabalo

Did the memoization happen?
Comment from : Total MonkeySpeed

Jeff is still my favourite tech youtuber
Comment from : Mercy

infinite loops arent totally uselessoperating systems and servers use infinite loops
Comment from : AnonymousAccount

yea() br yea()br yeah()br yeah()
Comment from : JasperDiscovers

What the inception hell is this
Comment from : Saeed Khan

Oh no, memoization is still not out :( (if I searched correctly)
Comment from : Gerrit Weiermann

song name?
Comment from : L-8

Like an Inception😜😅
Comment from : Avinash Dhumal

Lmfao if !woke 😍🙏
Comment from : CK San Diego

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 <3
Comment from : Strange

psyched for memoization!
Comment from : Samuel

Memoization?
Comment from : Ümit Can Evleksiz

0:14 me a cpp and c coder:thats a problem of the future
Comment from : Devika krishna 💫

Fireship please dont stop ever!
Comment from : Abhinav Rai

The production of these videos is pure art Really makes the concepts easy to grasp
Comment from : Eric Suzuki

Recursion it's not even that hard You just need to learn recursion first
Comment from : riverofcustard

I did not understand this
Comment from : Rafael

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
Comment from : Kolsky Traveller

bSad Discrete Math noises/b
Comment from : E S

I did this on minecraft
Comment from : Beetless

To really understand recursion, you must first understand recursion
Comment from : CarbonaraDaiSuki

It's also worth to mention a tail-call optimization It allows to avoid stack overflow for bigger recursions ;)
Comment from : Paweł Włodarczyk

Looking forward to part 3: dynamic programming
Comment from : 5Doum

If you need to understand recursion, you need to understand recursion
Comment from : Mehran Ujjan

This is basically the MIT recursion lecture but as a summary Wish I came here first would have saved some time
Comment from : Dan

Not n squared 2 to the nth power
Comment from : Kevin Chou

I dare you to explain monads in 100 seconds
Comment from : gamerkaue88

why always Fibonacci
Comment from : justCode

Waiting for your next video on memoization
Comment from : kajal mishra

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
Comment from : bo heem

2x for 50secs
Comment from : Piyush Mahapatra

by the time I settled down to watch the video, he said "thank you for watching"
Comment from : KayVirals

Your video representation, background music, and the way u explain is awesome man👏👍
Comment from : vaibhav singh negi

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
Comment from : Informaticage NJP