Write a program to find not prime number between given range
#include<iostream>
using namespace std;
int main()
{
int n,i,j,min,max;
cout<<"enter the min and max number: ";
cin>>min>>max;
for(i=min; i<=max; i++)
{
for(j=2; j<=i; j++)
{
if(i%j==0)
break;
}
if(i!=j)
{
cout<<"not prime number: "<<i<<endl;
}
}
return 0;
}
