0
You don't actually have to use a stack, but if your teacher wants that, you can please them:
int fact (int n)
{
int i, fct;
whatever_stack_type_you_have s;
initialize_your_stack (s);
push (s, n);
for (i=1, fct=1; i<n; ++i) fct *= i;
pop (s, &n);
fct *= n;
destroy_your_stack (s);
return fct;
}
What else can I help you with?
How to write a program to find the delimiter matching in stacks?
== == using recursions: unsigned int Factorial( unsigned int x) { if(x>0) { return ( x * Factorial(x-1)); } else { return(1); } } factorial: unsigned int Factorial( unsigned int x) { unsigned int u32fact = 1; if( x == 0) { return(1); } else { while(x>0) { u32fact = u32fact *x; x--; } } }
Write the Pseudocode to find the factorial of a number?
Pseudo code+factorial
Algorithm to find factorial using functions?
factorial using recursion style in c++ is unsigned int fact(unsigned int a) { if (a<=1) return 1; else { f*=fact(a-1); return a; } } when using looping structure factorial is unsigned int fact (unsigned int n) { unsigned int i,f=1; for(i=1;i<=n;i++) f*=i ; return f; }
How you can find a factorial of a number without using multiple operator?
If you really wanted to do this, you could simulate multiplication with repeated addition.
Using while loop Write a program find the factors of a number?
by this program you can find the factorial: #include<iostream> using namespace std; main() { int n,x,f=1; cin>> n; x=0; while(x<n) { x++; f= f*x; } cout<<"factorial is"<<f<<"\n"; system("pause"); return 0; }
How to write a program to find the delimiter matching in stacks?
== == using recursions: unsigned int Factorial( unsigned int x) { if(x>0) { return ( x * Factorial(x-1)); } else { return(1); } } factorial: unsigned int Factorial( unsigned int x) { unsigned int u32fact = 1; if( x == 0) { return(1); } else { while(x>0) { u32fact = u32fact *x; x--; } } }
By using call by reference find the factorial of a number?
chutia mc,bc bhosdika
Write a java program to find the factorial of a given number?
Here's a simple Java program to find the factorial of a given number using a recursive method: import java.util.Scanner; public class Factorial { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.print("Enter a number: "); int number = scanner.nextInt(); System.out.println("Factorial of " + number + " is " + factorial(number)); } static int factorial(int n) { return (n == 0) ? 1 : n * factorial(n - 1); } } This program prompts the user for a number and calculates its factorial recursively.
Write the Pseudocode to find the factorial of a number?
Pseudo code+factorial
Algorithm to find factorial using functions?
factorial using recursion style in c++ is unsigned int fact(unsigned int a) { if (a<=1) return 1; else { f*=fact(a-1); return a; } } when using looping structure factorial is unsigned int fact (unsigned int n) { unsigned int i,f=1; for(i=1;i<=n;i++) f*=i ; return f; }
Program to find n th fabonacci number?
#include #include using std::cin;using std::cout;using std::endl;using std::tolower;long factorial(const int& N);int main(){int N = 0; //factorial of Nchar command = 'n';do{cout > N;cout
How you can find a factorial of a number without using multiple operator?
If you really wanted to do this, you could simulate multiplication with repeated addition.
Can you make 4 stacks of pennies using 9 pennies?
Yes. However, they will not be regular stacks.
A program for simple factorial in prolog?
In Prolog, a simple factorial program can be defined using recursion. Here's a basic implementation: factorial(0, 1). % Base case: factorial of 0 is 1 factorial(N, Result) :- N > 0, N1 is N - 1, factorial(N1, Result1), Result is N * Result1. % Recursive case You can query the factorial of a number by calling factorial(N, Result). where N is the number you want to compute the factorial for.
Flowchart to find factorial of a given no?
Kat
output of a c program using function to find factorial of a number?
In a C program that calculates the factorial of a number using a function, the program typically prompts the user for an integer input. The function then recursively or iteratively computes the factorial by multiplying the number by the factorial of the number minus one until it reaches one. For example, if the user inputs 5, the program outputs 120, as 5! = 5 × 4 × 3 × 2 × 1. The final result is displayed on the screen.
Jntu 2-2 oops through java answers?
write a java program to find factorial using recursive and non recursive
