### kingofnumbers's blog

By kingofnumbers, 5 years ago,

If you want to understand recursion then follow the link

• +3

•  » » 5 years ago, # ^ |   +19 That's recursion!!! :)
•  » » 4 years ago, # ^ |   -64 not sure if you didn't git the joke , or you are just anti-joke chicken
•  » » 22 months ago, # ^ |   +13 r/whooooosh
 » 5 years ago, # |   +5 Did you learn from there only :D
 » 5 years ago, # |   0 Is there any elementary case? :P
•  » » 22 months ago, # ^ |   -9 You are the elementary case :p
 » 5 years ago, # |   +5 if you got the general idea of recursion — don't follow the link posted above
 » 5 years ago, # |   +2 when it ends oh kingofnumbers
•  » » 5 years ago, # ^ |   +14 as soon as you realize that it's infinite
 » 5 years ago, # |   0 I think you got an overflow there.
•  » » 5 years ago, # ^ |   +5 Only if your interpreter is bad.
 » 4 years ago, # |   -46 Good one kingofnumbers.
 » 4 years ago, # |   -28 Well Played :-D & Nicely Explained.
 » 4 years ago, # | ← Rev. 2 →   -23 Lol nice
 » 4 years ago, # | ← Rev. 11 →   -11 Persistence
 » 4 years ago, # |   +9 Google had already explained it before you :Phttps://www.google.com.eg/webhp?sourceid=chrome-instant&ion=1&espv=2&ie=UTF-8#q=recursion
 » 4 years ago, # |   -15 This is wittily(no)
 » 4 years ago, # |   -11 OHHH!!! I get it :D . It took me a while. I thought you gave a wrong link.
 » 4 years ago, # |   +4 And if you want to understand memoization click the link once and close the tab :D
•  » » 4 years ago, # ^ |   -6 No, This is not a DAG. Memorization isn't possible.
 » 4 years ago, # | ← Rev. 2 →   -6
 » 4 years ago, # | ← Rev. 2 →   -16 sorry
 » 22 months ago, # |   -11 Actually this trick is used when you search recursion in google.
 » 22 months ago, # |   -32 LooOooOooOoooL. That's not recursion. Recursion requires the problem to become smaller each time.
•  » » 22 months ago, # ^ |   0 I don't think you understand recursion properly. Please check this tutorial.