Calculating factorials using recursion : Function Recursive « Function « C / ANSI-C

C / ANSI-C 1.  assert.h 2.  Console 3.  ctype.h 4.  Data Structure Algorithm 5.  Data Type 6.  Development 7.  File 8.  Function 9.  Language Basics 10.  Macro Preprocessor 11.  Math 12.  math.h 13.  Memory 14.  Pointer 15.  setjmp.h 16.  signal.h 17.  Small Application 18.  stdio.h 19.  stdlib.h 20.  String 21.  string.h 22.  Structure 23.  time.h 24.  wctype.h Java Java Tutorial Java Source Code / Java Documentation Java Open Source Jar File Download Java Articles Java Products Java by API Photoshop Tutorials Maya Tutorials Flash Tutorials 3ds-Max Tutorials Illustrator Tutorials GIMP Tutorials C# / C Sharp C# / CSharp Tutorial C# / CSharp Open Source ASP.Net ASP.NET Tutorial JavaScript DHTML JavaScript Tutorial JavaScript Reference HTML / CSS HTML CSS Reference C Tutorial C++ C++ Tutorial Ruby PHP Python Python Tutorial Python Open Source SQL Server / T-SQL SQL Server / T-SQL Tutorial Oracle PL / SQL Oracle PL/SQL Tutorial PostgreSQL SQL / MySQL MySQL Tutorial VB.Net VB.Net Tutorial Flash / Flex / ActionScript VBA / Excel / Access / Word XML XML Tutorial Microsoft Office PowerPoint 2007 Tutorial Microsoft Office Excel 2007 Tutorial Microsoft Office Word 2007 Tutorial

C / ANSI-C » Function » Function Recursive Screenshots  Calculating factorials using recursion #include <stdio.h> long factorial(long); void main() {   long number = 0;   printf("\nEnter an integer value: ");   scanf(" %ld", &number);   printf("\nThe factorial of %ld is %ld\n", number, factorial(number)); } /* recursive factorial function */ long factorial(long N) {   if( N < 2 )     return N;   else      return N*factorial(N - 1); }                     Related examples in the same category 1.  A recursive power function 2.  Prints out Fibonacci numbers 3.  Recursive function call 4.  Function: Recursive call 5.  Copy string using recursion 6.  Recursive function with static variable