Write a c program to find factorial non recursive?

Answer 1

/*program for finding the factorial*/

void main()

{

int a,b=1;

clrscr();

printf("Please enter any number to find its factorial\n");

scanf("%d",&a);

while(a>1)

{

b=b*a;

a--;

}

printf("factorial is %d",b);

getch();

}

Answer 2

//Factorial using recursive function

#include <stdio.h>

//To increase the limit, the return type should be changed to unsigned long

int fact(int number)

{

if (number == 0)

return 1;

return fact(number-1) * number;

}

int main(void)

{

int number ;

printf("Enter the number to find the factorial:");

scanf("%d",&number);

printf("The factorial is:%d",fact(number));

return 0;

}

Answer 3

#include <cstdio>

int fact(int x);

int main()

{

int x, total;

printf("Enter a number: ");

scanf("%d", &x);

total = fact(x);

printf("The factorial of %d is %d", x, total);

char wait;

scanf("%s", wait);

return 0;

}

int fact(int x)

{

if(x == 1)

{

return 1;

}

return fact(x - 1) * x;

}

Answer 4

#include <iostream>

unsigned int factorial(const unsigned int n)

{

// The factorial of 0 and 1 (0! and 1!) is 1.

if(n<2)

return(1);

// All other values are the product of n and n-1.

return(factorial(n-1)*n);

}

int main()

{

std::cout<<"The factorial of 5 is "<<factorial(5)<<std::endl;

}

Note that a 32-bit unsigned int can accomodate factorials up to 12! while 64-bits would allow up to 20!. Floating point types with 2-digit exponents can accomodate up to 69!. Even the scientific calculator in Windows 7 and 8 can only handle up to 3248!. To accomodate larger values you must implement a user-defined dynamic integer that uses as many bits as necessary.

Answer 5

This program uses a non recursive portable factorial algorithm that supports arbitrary length decimal arithmetic in a linked list. The primary algorithm is decimal_NFactIterative. For vary large values, you may need to increase your binder stack size.

#include <stdlib.h>

#include <stdio.h>

/* 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 */

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 ("Arbitrary: %u! = ", N);

decimal_NFactIterative (&Decimal, N);

decimal_print_digits (&Decimal, true);

return 0;

}

Answer 6

factorial is simply multiplication of n-1 to 1

there are majorly two approaches

1. recrsive 2. looping

both have advantages on each other.

both codes and algorithm is shred on theprogrammingx.co.uk just visit and confirm.

Answer 7

Let's see the factorial Program using loop.

#include

int main()

{

int i,fact=1,number;

printf("Enter a number: ");

scanf("%d",&number);

for(i=1;i

Answer 8

1. #include

2. int main()

Answer 9

l

Answer 10

hope you like the answers