Head Recursion | Tail Recursion | Head VS Tail Recursion | EP4

In this video, we will learn head recursion, tail recursion and head vs tail recursion with example.
recursion basics with examples: https://youtu.be/Sf-LR7OI-Ww
python Tutor Tutorial link: https://youtu.be/TRMKJucB3B8
recursion visualization: https://youtu.be/AIwxbJ5mP8M

In this video, I will be covering Head recursion then Tail recursion then Head vs tail recursion after that we will see a Demo And at the end we will do a quick quiz? Head recursion A function is called head recursive if recursive call is made before it performs its own task and this process is known as head recursion. Let’s try to understand this with the help of an example The problem statement is, given an integer n, print the sequence of integer. So, here is the algorithm to do the same. Let’s take input is 5. will go through the code and try to visualize the stack frame, execution flow and console output. So, this is output bar which will display the output so far, this is stack frame which will help us to see the current method execution call. and this window will help us to visualize our recursive algorithm flow. Guys, in this window whatever you will see it will be the internal state of this method which I am printing here, it is just for visualization purpose to make you understand how it works internally. If you want to know on which basis this execution flow is getting printed here, so let me tell you just by adding couple of console output statement in this code will get you this. In demo section, we will see this practically. So let’s start our visualization. As we know, main method is the first one which will be invoked when program execution starts, so I have put that method first into the stack. Now main() method will call this function headRec(5) Let’s see the current state of the execution Main() method call execution is put on hold for some time and until headRec(5) method will return. Here n=5, so if condition is false, it will go to the else block. now it will call itself headRec(4) by reducing the n value by 1.