import java.io.*;
class GFG {
void prime1(int j,int i,int c)
{
if(i%j==0)
{
c=1;
}
if(j<i-1)
prime1(++j,i,c);
else
{
if(c==0 && i!=0 && i!=1)
System.out.println(i);
}
}
void prime(int i,int n)
{
if(i<n)
{
prime1(2,i,0);
prime(++i,n);
}
}
public static void main (String[] args) {
GFG ob=new GFG();
ob.prime(100,200);
}
}
class GFG {
void prime1(int j,int i,int c)
{
if(i%j==0)
{
c=1;
}
if(j<i-1)
prime1(++j,i,c);
else
{
if(c==0 && i!=0 && i!=1)
System.out.println(i);
}
}
void prime(int i,int n)
{
if(i<n)
{
prime1(2,i,0);
prime(++i,n);
}
}
public static void main (String[] args) {
GFG ob=new GFG();
ob.prime(100,200);
}
}
Wrong da!
ReplyDeleteHow can recursive calls be O(1)...Cheating da!
Delete