What are Tail-Recursive Methods? | Tail-Recursion Made Simple | Tail-Call Optimization | Geekific

Support us on Patreon: / geekific
Discord Community: / discord
GitHub Repository: github.com/gee...
In one of our previous uploads we discussed recursion and how to come up with recursive methods given a particular problem. In this video, we explain tail-recursion, what distinguishes tail-recursive methods from normal ones, and most importantly how to transform a recursive into a tail-recursive method and why do you want to do that, if you want to do it.
Timestamps:
00:00 Introduction
00:20 What is Tail-Recursion?
02:43 Transforming a Head-Recursive into a Tail-Recursive method
05:11 Visualizing Tail-Recursion
06:50 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
- Object-Oriented Programming Fundamentals: • What is Object-Oriente...
- SOLID Principles and Best Practices: • SOLID Design Principle...
- Project Lombok Annotations Explained: • Project Lombok Annotat...
- Recursion Made Simple: • What is Recursion? | R...
- What is a Thread?: • What is a Thread? | Th...
- Must Know Java Keywords!: • Must Know Java Keyword...
#Geekific #TailRecursion #RecursiveMethods

[@deepayanbiswas4488]

The description, the transformations, the visualization WOW!
Glad I found this gem of a channel, life will be simpler now :)

[@geekific]

Thanks a lot for your support! Am very glad the video was helpful :)

[@ahmadsaqer8578]

Helpful and straight to the point , thanks !

[@sourandbitter3062]

Love computer science, there are so many interesting concepts to learn.

[@danielnzuma9070]

take home
Continuation passing style might be the only generic way out there that allows you to transform any code into a form that uses only tail calls hence reducing space complexity of recursive calls from O(n) to O(1)

[@salvageddoor]

Excellent. Just what I needed

[@geekific]

Glad it is :)

[@yash1152]

2:49 to rephrase the given code:
factorial(n) = factorial(n, 1)
factorial(1, x) = x
factorial(n, x) = factorial(n - 1, n * x)
as compared to simple:
factorial(1) = 1
factorial(n) = n * factorial(n - 1)
hahaha, that's basically encoding the looping variables inside the function call itself.
this is exaclty what:
* i inferred while trying to write binomial coefficients recurcively, and later
* an article said about tail rec: "it's effectively using fxn calls to implicitly control the repetitions, rather than using explicit loops"

[@yash1152]

this is basically like creating an interface - which seems good on outside but in internal inolementation, the structure of the problem at hand is butchered.
which is one of the key selling pt of recursion: easily replicate the problem structure.
but yeah, other benefits to recursion still exists: its functional & stateless nature.

[@raghavsharma4195]

Woo finally video after 1 week 😅

[@geekific]

Well yeah, I work full-time, so I upload once a week at the same time (banner has the timings)... Sorry can't upload more atm 😥

[@svalyavasvalyava9867]

I am very thankful!

[@geekific]

Thank you! Glad I could help :)

[@samuelkrau3916]

Thank you so much. Very helpful :)

[@geekific]

Glad it was helpful :)

[@raghavsharma4195]

Need multithreading playlist

[@geekific]

Nice!

[@jx3806]

✌👍👍

[@geekific]

[@vengateshm2122]

Geek stuff.

[@geekific]

Thanks!