Program to Find the Prime Numbers in the Given Range
Definition & Explanation
Example:
Input:
Output:
More Description
Program Logic
Desc
C
Method 1 :
#include <stdio.h>
int checkPrime(int num) {
if (num < 2)
return 0;
else {
int x = num / 2;
for (int j = 2; j <= x; j++) {
if (num % j == 0)
return 0;
}
}
return 1;
}
int main() {
int a = 1, b = 50;
for (int i = a; i <= b; i++) {
if (checkPrime(i))
printf("%d ", i);
}
return 0;
}
Output :
C++
Method 1 :
#include <iostream>
using namespace std;
int checkPrime(int num) {
if (num < 2)
return 0;
else {
int x = num / 2;
for (int j = 2; j <= x; j++) {
if (num % j == 0)
return 0;
}
}
return 1;
}
int main() {
int a = 1, b = 50;
for (int i = a; i <= b; i++) {
if (checkPrime(i))
cout << i << " ";
}
return 0;
}
Output :
JAVA
Method 1 :
public class Main {
static int checkPrime(int num) {
if (num < 2)
return 0;
else {
int x = num / 2;
for (int j = 2; j <= x; j++) {
if (num % j == 0)
return 0;
}
}
return 1;
}
public static void main(String[] args) {
int a = 1, b = 50;
for (int i = a; i <= b; i++) {
if (checkPrime(i) == 1)
System.out.print(i + " ");
}
}
}
Output :
Python
Method 1 :
def checkprime(num):
if num<2:
return 0
else:
x=num//2
for j in range(2,x+1):
if num%j==0:
return 0
return 1
a,b=1,50
for i in range(a,b+1):
if checkprime(i):
print(i,end=" ")Output :
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 Program to check : Heading
Definition & Explanation
Example:
Input:
Output:
More Description
Heading
Desc
C
Method 1 :
Output :
C++
Method 1 :
Output :
JAVA
Method 1 :
Output :
Python