//**************************************
//     
// Name: Absolute Recursive factorial fu
//     nction C++
// Description:C++ VERSION OF Recursive 
//     factorial function It will get a number 
//     and gives you it's factorial using a Rec
//     ursive function ( a function that calls 
//     itself)
// By: Arjang
//
//This code is copyrighted and has// limited warranties.Please see http://
//     www.Planet-Source-Code.com/xq/ASP/txtCod
//     eId.753/lngWId.3/qx/vb/scripts/ShowCode.
//     htm//for details.//**************************************
//     

/* Recursive factorial function programmed by Arjang
for more info email me arjang7@hotmail.com
a recursive function is a function that will call itself
it is probably the most difficult type of function designing
but when you get use to it, you'll find it VERY USEFULL 
the c version of this function is also available right here.
*/
//inserting header file
#include<iostream>
using namespace std;
//declaring function
int factorial(int);
void main(void)
    {
    int number, result;
    cout<<"Please Enter A number to get it's factorial: ";
    //getting our target number
    cin>>number;
    //calling the function
    result = factorial(number + 1);
    //printing out results
    cout<<endl<<"The factorial is : "<< result;
    cout<<endl<<endl<<endl<<endl<<endl;
}

int factorial(int victim)
    {
    if(victim>1)
        {
        victim = victim - 1;
        /*this is the whole point where you actually call the same function which you are into, it is called a recursive function. */
        victim = victim * factorial(victim);
    }

    return victim;
}