assignment-p-01.c¶
Problem Statement
Write a C program that includes a user-defined function named isPrime with the signature int isPrime(int num); The function should take an integer as a parameter and return 1 if the number is prime and 0 otherwise.
Metadata¶
| Property | Detail |
|---|---|
| Author | Amit Dutta amitdutta4255@gmail.com |
| Date | 12 Dec 2025 |
| License | MIT License (See the LICENSE file for details) |
| Difficulty | Beginner (index: 3 / 10) |
Concepts¶
Beta Feature
This concept detection system is still in beta and may occasionally show incorrect or incomplete results.
- Recursion
- Iteration
Actions¶
You can print or save this file by opening Raw and using your browser.
Source Code¶
#include <stdio.h>
#include <math.h>
int isPrime(int);
int main()
{
int n;
printf("Enter the number: ");
scanf("%d", &n);
if (isPrime(n))
{
printf("\nInput %d is a Prime Number.", n);
}
else
{
printf("\nInput %d is not a Prime Number.", n);
}
return 0;
}
int isPrime(int n)
{
if (n <= 1)
return 0;
if (n == 2)
return 1;
if (n % 2 == 0)
return 0;
int temp = (int)sqrt(n);
int i;
for (i = 3; i <= temp; i += 2)
{
if (n % i == 0)
{
return 0;
}
}
return 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 (assignment-p-01.c):
#include <stdio.h>
#include <math.h>
int isPrime(int);
int main()
{
int n;
printf("Enter the number: ");
scanf("%d", &n);
if (isPrime(n))
{
printf("\nInput %d is a Prime Number.", n);
}
else
{
printf("\nInput %d is not a Prime Number.", n);
}
return 0;
}
int isPrime(int n)
{
if (n <= 1)
return 0;
if (n == 2)
return 1;
if (n % 2 == 0)
return 0;
int temp = (int)sqrt(n);
int i;
for (i = 3; i <= temp; i += 2)
{
if (n % i == 0)
{
return 0;
}
}
return 1;
}