VB icon

Absolute Recursive factorial function

Email
Submitted on: 1/1/2015 12:32:00 PM
By: Arjang (from psc cd)  
Level: Intermediate
User Rating: By 2 Users
Compatibility: C
Views: 1263
 
     Recursive factorial function 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 write here.
 

INCLUDE files:

Can't Copy and Paste this?
Click here for a copy-and-paste friendly version of this code!
//**************************************
//INCLUDE files for :Absolute Recursive factorial function
//**************************************
stdio.h
code:
Can't Copy and Paste this?
Click here for a copy-and-paste friendly version of this code!
				
//**************************************
// Name: Absolute Recursive factorial function
// Description:Recursive factorial function 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 write here.
// By: Arjang (from psc cd)
//**************************************

/* 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 write here.
*/
//inserting header file
#include<stdio.h>
//declaring function
int factorial(int);
void main(void)
{
	int number, result;
	printf("Please Enter A number to get it's factorial: ");
	//getting our target number
	scanf("%d", &number);
	//calling the function
	result = factorial(number + 1);
	//printing out results
	printf("\nThe factorial is : %d", result);
	printf("\n\n\n\n\n\n");
}
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;
}


Other 1 submission(s) by this author

 


Report Bad Submission
Use this form to tell us if this entry should be deleted (i.e contains no code, is a virus, etc.).
This submission should be removed because:

Your Vote

What do you think of this code (in the Intermediate category)?
(The code with your highest vote will win this month's coding contest!)
Excellent  Good  Average  Below Average  Poor (See voting log ...)
 

Other User Comments


 There are no comments on this submission.
 

Add Your Feedback
Your feedback will be posted below and an email sent to the author. Please remember that the author was kind enough to share this with you, so any criticisms must be stated politely, or they will be deleted. (For feedback not related to this particular code, please click here instead.)
 

To post feedback, first please login.