Input
Enter the range to print Prime Number : 2 35
Output
Prime Number from 2 and 35 are : 2 3 5 7 11 13 17 19 23 29 31
Step 1: START
Step 2: Declare variable num1,num2,flag;
Step 3: Input range from user and store it into num1 and num2.
Step 4: Now we have to check each number from low limit number to upper limit number one by one if it is found prime then print it.
Logic
first for Loop for range incease lower limit by 1 in eacch iteration
second for Loop for check it is prime or not
Step 5: for(int i=num1;i<num2;++i) {
flag = 0 ;
for(int j=2;j<=num/2;j++){
if( i % j == 0){
flag=1
break; }
}
if flag == 0 && i != 1
print i.
}
Step 6: END
/* Print all prime numbers in a given range */
#include<stdio.h>
int main()
{
int num1,num2,flag;
printf(" Enter the range to print prime number : ");
scanf("%d%d",&num1,&num2);
printf(" Prime number from %d and %d are : ",num1,num2);
for(int i=num1;i<num2;++i)
{
flag=0;
for(int j=2;j<=i/2;++j)
{
if(i % j == 0)
{
flag=1;
break;
}
}
if(flag == 0 && i > 1)
printf(" %d",i);
}
return 0;
}
/* Print all prime numbers in a given range */
#include<iostream>
using namespace std;
int main()
{
int num1,num2,flag;
cout<<" Enter the range to print prime number : ";
cin>>num1>>num2;
cout<<" Prime number from "<<num1<<" and "<<num2<<" are : ";
for(int i=num1;i<num2;++i)
{
flag=0;
for(int j=2;j<=i/2;++j)
{
if(i % j == 0)
{
flag=1;
break;
}
}
if(flag == 0 && i > 1)
cout<<" "<<i;
}
return 0;
}
Enter the range to print Prime Number : 2 35
Prime Number from 2 and 35 are : 2 3 5 7 11 13 17 19 23 29 31
advertisment