/* This program demonstrates function recursion, where a function calls itself
 * We show what happens when a recursive function doesn't have an escape clause
 * That causes a segmentation fault (program is out of memory.
 * We also demonstrate the right way to write a recursive function.
 */
#include<iostream>
using namespace std;
//to demonstrate segfauts
//Recursive call without an escape
void someFunction()
{
	cout<<"Dormamu, I've come to bargain!!!"<<endl;
	someFunction();
}

//another way of finding a factorial of a number
//Base case" f(1) = 1
// Recursion: f(n) = f(n-1) * n
// This follows from the definition of a factorial
long factorial( long num)
{
	if(num == 1) 
		return 1;
	return factorial (num-1) * num;
}
int main()
{
	//someFunction(); //don't do this. will crash

	long val;
	cout<<"Enter a number: ";
	cin>>val;
	cout<<"The factorial is "<<factorial(val)<<endl;
}