FINDOUT THE FACTORIAL OF A NUMBER USING RECURSION

[S J K]

I have a program here. I would like to know how recursion works.

//program to find the factorial of a number using recursive fuction

#include<iostream.h>


int recfact(int); //fuction prototype
int main()
{
int n;
cout<<"Enter a number ";
cin>>n;
cout<<n<<"!="<<recfact(n);
return;
} //main() ends

int recfact(int m)
{
if(m<2)
return(1);
return(m*recfact(m-1)); //recursion
}

[z05DSL3A]

http://en.wikipedia.org/wiki/Recursion_%28computer_science%29