C program to find factorial of a given number using pointers?

Answer 1

/*** returns N!, assume N >= 0 ***/

int Factorial(int n) {

if (n <=1 ) /* 0! = 1! = 1 */ return 1;

/** you can place as many know values as you want, like 2!, 3!, etc **/

/** but, recursive call will do just fine, ... **/

return n * Factorial(n - 1); /** compute N * (N-1)! **/

}

Answer 2

/*mycfiles.wordpress.com Program for Factorial*/

#include<stdio.h>

#include<conio.h>

void main()

{

int n,fact=1;

clrscr();

printf("Enter any Number:\n\n");

scanf("%d",&n);

while(n>1)

{

fact=fact*n;

n-;

}

printf("\nFactorial is=%d",fact);

getch();

}

Answer 3

factorial of a given number using pointers.

#include<stdio.h>

#include<conio.h>

main()

{

int n, factorial;

printf("\nEnter a number");

scanf("%d", &n);

factcompute(n, &factorial);

printf("\nThe factorial of %d is %d", n, factorial);

}

factcompute(a, b)

int a, *b;

{

int m;

*b = 1;

for (m = 1; m <= a; m++)

*b = *b * m;

getch();

}

Answer 4

This program will compute N Factorial for any N, and does not suffer from overflow, because it uses a bin technique and handles each digit individually. For large values of N, you may need to increase your run-time stack size.

/* Portable arbitrary length decimal iterative */

/* one node of a linked list of digits, the first node being low-order */

struct _decimal {

int digit;

struct _decimal *next;

};

typedef struct _decimal decimal;

/* Portable arbitrary length decimal iterative */

/* Initialize the list - necessary on second pass, if main recoded */

void decimal_initialize (decimal *d, int n) {

decimal *next, *nextsave;

d->digit = n;

nextsave = d->next;

d->next = NULL;

next = nextsave;

while (next != NULL) {

nextsave = next->next;

free (next);

next = nextsave;

}

return;

}

/* Portable arbitrary length decimal iterative */

/* Append a digit at the high order position */

void decimal_add_digit (decimal *d, int n) {

decimal *new_digit = (decimal*) malloc (sizeof (decimal));

while (d->next != NULL) d = d->next;

new_digit->digit = n;

new_digit->next = NULL;

d->next = new_digit;

return;

}

/* Portable arbitrary length decimal iterative */

/* Print the digits in reverse order - recursive */

void decimal_print_digits (decimal *d, int last_digit) {

if (d->next != NULL) decimal_print_digits (d->next, false);

printf ("%d", d->digit);

if (last_digit) printf("\n");

return;

}

/* Portable arbitrary length decimal iterative */

/* multiply the list by N */

void decimal_multiply (decimal *d, int N) {

int carry = 0;

while (d != NULL) {

d->digit = d->digit * N + carry;

carry = d->digit / 10;

d->digit %= 10;

if (carry != 0 && d->next 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 ("%d", &N);

} else {

N = atoi (argv[1]);

}

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

decimal_NFactIterative (&Decimal, N);

decimal_print_digits (&Decimal, true);

return 0;

}

Answer 5

#include
#include
void main()
{
int a,b,c=1;
clrscr();
{
printf("enter the number b=");
scanf("%d",&b);
}
for(a=b;a>=1;a--)
c=c*a;
{
printf("the factorial of the num is%d",c);
}
getch();
}

Answer 6

#include<iostream.h>

#include<conio.h>

int fact(int a)

{ int p=1,i;

for(i=1;i<=a;i++)

p*=1;

return (p);

}

void main()

{ int no,p;

cout<<"Enter the number";

cin>>no;

p=fact(no);

cout<<"The Factorial of "<< no <<"is"<<p;

getch();

}

Answer 7

#include<stdio.h>

int factorial(int *);

main()

{

int n,fact;

printf("Enter any integer number you wish to find its factorial\n");

scanf("%d",&n);

fact=factorial(&n);

printf("\n");

printf("The factorial of %d is %d\n",n,fact);

return 0;

}

int factorial(int *num)

{

int i,product=1;

for(i=1;i<=*num;i++)

product*=i;

return product;

}

Answer 8

#include <stdio.h> int main() { int c, n, fact = 1; printf("Enter a number to calculate it's factorial\n"); scanf("%d", &n); for (c = 1; c <= n; c++) fact = fact * c; printf("Factorial of %d = %d\n", n, fact); return 0; }

Answer 9

unsigned factorial (unsigned num) {

return num <2 ? 1 : num * factorial (num-1);

}