Program to find factorial of a number using recursion?

Answer 1

#include<conio.h>

#include<stdio.h>

void main()

{

clrscr();

int i=1,fact=1,n;

printf("enter a no.");

scanf("%d"n);

while(i<=n)

{

fact=i*fact;

i++;

}

printf("factorial=%d",fact);

getch();

}

Answer 2

1. You should write the program for it is your homework.

2. You should be able to use Google.

3. Here you are:

int fact (int n)

{

if (n<=1) return 1;

else return n*fact(n-1);

}

Answer 3

A C, C#/Java code segment:

int Factorial(int n) {

if (n <=1) return 1; // of course, if n < 0 should be an error...

return Factorial(n-1) * n;

}

Answer 4

The following program will find the factorial of any number using both recursion and non-recursion, using different precisions typically available, in this case to the Microsoft Visual Studio platform. It includes an arbitrary precision decimal package that will calculate large factorials, showing the comparison of results between the different methods. Note that stack utilization is high for large numbers, so you may need to tell your linker/binder to increase the run-time stack.

// Factorial.cpp : Defines the entry point for the console application.

//

#ifndef _WIN32_WINNT /* Microsoft stuff - possibly not needed */

#define _WIN32_WINNT 0x0600 /* Microsoft stuff - possibly not needed */

#endif /* Microsoft stuff - possibly not needed */

#include <stdlib.h>

#include <stdio.h>

#include <tchar.h> /* possibly not needed */

/* Microsoft 32-bit iterative */

unsigned long NFactLongIterative (unsigned long N) {

unsigned long result = N;

if (N < 2) return 1;

if (N 2) {

decimal_initialize (d, 2);

return;

}

while (N > 2) {

decimal_multiply (d, N);

N--;

}

return;

}

/* Example main line */

/* Generates all variations to show differences in results */

int main (int argc, char *argv[]) {

int N;

decimal Decimal = {2, NULL};

if (argc < 2) {

printf ("Enter N (or use command line) : ");

scanf_s ("%d", &N);

} else {

N = atoi (argv[1]);

}

printf ("Long: %u! = %u\n", N, NFactLongIterative (N));

printf ("LongLong: %u! = %I64u\n", N, NFactLongLongIterative (N));

printf ("Recursive: %u! = %I64u\n", N, NFactLongLongRecursive (N));

printf ("Double: %u! = %.0f\n", N, NFactDouble (N));

/* note: arbitrary is exact - if the others don't match, arithmetic overflow occurred */

printf ("Arbitrary: %u! = ", N);

decimal_NFactIterative (&Decimal, N);

decimal_print_digits (&Decimal, true);

return 0;

}