pc-ip-14.c¶
Problem Statement
Question 14: Write a program to calculate the factorial of a number using recursive and iterative function.
Metadata¶
| Property | Detail |
|---|---|
| Author | Amit Dutta (amitdutta4255@gmail.com) |
| License | MIT |
| Difficulty | Beginner (index: 2 / 10) |
Concepts¶
Beta Feature
This concept detection system is still in beta and may occasionally show incorrect or incomplete results.
- Recursion
- Pointers
- Iteration
Actions¶
You can print or save this file by opening Raw and using your browser.
Source Code¶
#include <stdio.h>
long long int fact_rec(int);
long long int fact_ite(int);
int main()
{
int n;
printf("Enter the number: ");
scanf("%d", &n);
printf("\nFactorial of %d (Recursion): %lld", n, fact_rec(n));
printf("\nFactorial of %d (Iteration): %lld", n, fact_ite(n));
return 0;
}
long long int fact_ite(int n)
{
int i, pd = 1;
for (i = 1; i <= n; i++)
{
pd *= i;
}
return pd;
}
long long int fact_rec(int n)
{
if (n == 0)
{
return 1;
}
else
{
return n * fact_rec(n - 1);
}
}
Explanation¶
Explain with AI
Copy the prompt below and paste it into any AI assistant.
You are explaining a C programming code to a beginner.
STRICT RULES:
- Only use the given code. Do NOT assume anything not present.
- Do NOT add extra examples.
- Keep explanation clear and short.
- If something is unclear, say "Not clear from code".
- Follow the exact format below. Do NOT change headings.
FORMAT:
[START]
## What it does
(Explain the overall purpose in 1-2 sentences)
## Step-by-step
(Explain how the code works in steps, simple language)
## Key Concepts
(List concepts like loop, condition, function, etc.)
## Notes
(Mention any limitations, errors, or assumptions)
[END]
CODE (pc-ip-14.c):
#include <stdio.h>
long long int fact_rec(int);
long long int fact_ite(int);
int main()
{
int n;
printf("Enter the number: ");
scanf("%d", &n);
printf("\nFactorial of %d (Recursion): %lld", n, fact_rec(n));
printf("\nFactorial of %d (Iteration): %lld", n, fact_ite(n));
return 0;
}
long long int fact_ite(int n)
{
int i, pd = 1;
for (i = 1; i <= n; i++)
{
pd *= i;
}
return pd;
}
long long int fact_rec(int n)
{
if (n == 0)
{
return 1;
}
else
{
return n * fact_rec(n - 1);
}
}