# Calculate factorials using recursion : Recursive Function « Function « C Tutorial

Home
C Tutorial
 1 Language 2 Data Type 3 String 4 printf scanf 5 Operator 6 Statement 7 Array 8 Function 9 Structure 10 Pointer 11 Memory 12 Preprocessor 13 File 14 Data Structure 15 Search Sort 16 Wide Character String 17 assert.h 18 ctype.h 19 math.h 20 setjmp.h 21 signal.h 22 stdio.h 23 stdlib.h 24 string.h 25 time.h 26 wctype.h
 C Tutorial » Function » Recursive Function
8.8.2.Calculate factorials using recursion
 ```#include  unsigned long factorial(unsigned long); int main(void) {   unsigned long number = 0L;   printf("\nEnter an integer value: ");   scanf(" %lu", &number);   printf("\nThe factorial of %lu is %lu\n", number, factorial(number));   return 0; } unsigned long factorial(unsigned long n) {   if(n < 2L)     return n;   else     return n*factorial(n - 1L); }```
 8.8.Recursive Function 8.8.1. Recursion 8.8.2. Calculate factorials using recursion 8.8.3. Recursive fibonacci function
 java2s.com  | Contact Us | Privacy Policy Copyright 2009 - 12 Demo Source and Support. All rights reserved. All other trademarks are property of their respective owners.