Recursion-and-Types/tail_recursion.cpp at main · toqeersheikh/Recursion-and-Types · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
#include<iostream>
using namespace std;

void fun(int n)
{
	if(n>0)
	{
	    //Tail Recursion
	    //Means it doesn't have to perform anything at returning phase
		cout<<n<<" ";
		fun(n-1);
	 	//recursive call is the last statement in function
		//fun(n-1)+n; Even this is not a tail recursion because at returning phase n will be added
	}
}

int main()
{
	int x=5;
	fun(x);
	return 0;
}