Finding-Prime-Numbers/primebetween.java at master · vcsolutions/Finding-Prime-Numbers · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
import java.util.*;

class primebetween{

public static void main(String[]args){

    int flag=0;

    System.out.println("Enter any number two number: ");
	Scanner sc=new Scanner(System.in);

    int a = sc.nextInt();
    int b = sc.nextInt();

    System.out.println();

    if(a<2)
    {
        System.out.println("2,");
    }

    if((a+1)%2!=0)
{

    for(int i=a+1;i<b;i=i+2){

        flag=0;


        int root=(int)Math.sqrt(i);

        for(int j=2;j<=root;j++){
            if(i%j==0)
            flag=1;

        }

        if(flag==0)
        System.out.println(i+", ");

    }
}

    else{

        for(int i=a+2;i<b;i=i+2){

            flag=0;

            int root=(int)Math.sqrt(i);

            for(int j=2;j<=root;j++){
                if(i%j==0)
                flag=1;
            }

            if(flag==0)
	System.out.println(i+", ");

        }

    }
}
}