PROGRAM
/* Program to find prime numbers in a given range, display their count and also display maximum and minimum prime numbers in that range. */
#include <iostream>
using namespace std;
bool check_for_prime(int n)
{
bool prime=true;
int i=1,factors=0;
if(n==1 || n==0)
{
prime=false;
}
else
{
for(i=1;i<=n/2;i++)
{
if(n% i==0)
{
factors++;
}
}
if(factors>1)
{
prime=false;
}
}
return prime;
}
int main()
{
int lower,upper,temp,i,count=0,min_prime,max_prime,prev_prime=0;
bool prime ;
cout<<"enter the lower limit ";
cin>>lower;
cout<<"enter the upper limit ";
cin>>upper;
if(lower<0 || upper<0 || lower==upper)
{
cout<<"\nThe end limits cannot be negative or same";
}
else
{
if(lower>upper)
{
temp=lower;
lower=upper;
upper=temp;
}
for(i=lower;i<=upper;i++)
{
prime=check_for_prime(i);
if(prime==true)
{
count++;
cout<<i<<" ";
if(count==1)
{
min_prime=i;
}
prev_prime=i;
}
}
max_prime=prev_prime;
if(count>0)
{
cout<<"\ntotal number of prime numbers between "<<lower<<" and "<<upper<<" are <<count;
cout<<"\nminimum prime number in range : "<<min_prime;
cout<<"\nmaximum prime number in range : "<<max_prime;
}
else
{
cout<<"\nNo prime numbers found in this range";
}
}
return 0;
}
OUTPUT
