🎓 Top 15 Udemy Courses (80-90% Discount): My Udemy Courses - Ramesh Fadatare — All my Udemy courses are real-time and project oriented courses.
▶️ Subscribe to My YouTube Channel (178K+ subscribers): Java Guides on YouTube
▶️ For AI, ChatGPT, Web, Tech, and Generative AI, subscribe to another channel: Ramesh Fadatare on YouTube
1. Introduction
A prime number is a number greater than 1 that is divisible only by 1 and itself. Prime numbers play a pivotal role in number theory, encryption, and other areas of mathematics and computer science. In this article, we will develop a C program that checks whether a given number is prime.
2. Program Overview
The sequence of our program will be:
1. Ask the user for a number.
2. Check if the number is prime or not.
3. Display the result to the user.
3. Code Program
#include <stdio.h> // Integrate the Standard I/O library for input and output functionalities
int main() { // Main function commencement
int num, flag = 0;
// Prompting user for input
printf("Enter a positive integer: ");
scanf("%d", &num); // Acquire the user's number
// Prime numbers are greater than 1
if (num <= 1) {
printf("%d is not a prime number.\n", num);
return 1;
}
// Check from 2 to num/2
for (int i = 2; i <= num / 2; ++i) {
// If num is divisible by any number other than 1 and itself
if (num % i == 0) {
flag = 1;
break;
}
}
// If flag remains 0, num is prime
if (flag == 0) {
printf("%d is a prime number.\n", num);
} else {
printf("%d is not a prime number.\n", num);
}
return 0; // Indicate successful execution of the program
}
Output:
Enter a positive integer: 17 17 is a prime number.
4. Step By Step Explanation
1. #include <stdio.h>: This header file inclusion equips us with the standard input-output functionalities.
2. int main(): This is the main function where the program execution starts.
3. Initialization of num and flag: The variable num will store the user's input, while flag is used as an indicator. If the number is divisible by any number other than 1 and itself, flag will be set to 1.
4. The prime number check:
- If the number is less than or equal to 1, it's not prime.
- Otherwise, we use a loop to check divisibility from 2 up to num/2. If num is divisible by any number in this range, it's not prime. By checking only up to num/2, we optimize the program, as no number is divisible by a number larger than its half.
5. Output: The program displays whether the entered number is prime or not based on the flag value.
This approach offers an intuitive method to check for prime numbers and highlights the importance of optimization (checking only up to num/2) in programming.
My Top and Bestseller Udemy Courses. The sale is going on with a 70 - 80% discount. The discount coupon has been added to each course below:
Build REST APIs with Spring Boot 4, Spring Security 7, and JWT
![[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25](https://img-c.udemycdn.com/course/750x422/6852721_b512_2.jpg "[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25")
[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25
ChatGPT + Generative AI + Prompt Engineering for Beginners
Spring 7 and Spring Boot 4 for Beginners (Includes 8 Projects)
Available in Udemy for Business
Building Real-Time REST APIs with Spring Boot - Blog App
Available in Udemy for Business
Building Microservices with Spring Boot and Spring Cloud
Available in Udemy for Business
Java Full-Stack Developer Course with Spring Boot and React JS
Available in Udemy for Business
Build 5 Spring Boot Projects with Java: Line-by-Line Coding
Testing Spring Boot Application with JUnit and Mockito
Available in Udemy for Business
Spring Boot Thymeleaf Real-Time Web Application - Blog App
Available in Udemy for Business
Master Spring Data JPA with Hibernate
Available in Udemy for Business
Spring Boot + Apache Kafka Course - The Practical Guide
Available in Udemy for Business
Comments
Post a Comment
Leave Comment