We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 72d30ce + 5dbdd3f commit 491ea26Copy full SHA for 491ea26
SieveOfEratosthenes.java
@@ -0,0 +1,42 @@
1
+import java.util.*;
2
+public class SieveOfEratosthenes {
3
+
4
5
+ static boolean[] sieveOfEr(int n)
6
+ {
7
+ boolean isPrime[]=new boolean[n+1];
8
+ Arrays.fill(isPrime,true);
9
+ for(int i=2;i*i<=n;i++)
10
+ { for(int j=2;j<=n;j=j+i)
11
12
+isPrime[j]=false;
13
+ }
14
15
16
+ return isPrime;
17
18
19
+ public static void main (String args[])
20
+{
21
+ Scanner sc=new Scanner(System.in);
22
23
+ int n=sc.nextInt();
24
+ boolean iPrime[]=sieveOfEr(n);
25
+ for(int i=2;i<n;i++)
26
27
28
+ if(iPrime[i]==true)
29
30
+ System.out.print(i+" ");
31
32
33
34
35
36
37
+ sc.close();
38
39
40
41
+}
42
0 commit comments