FilesExpand file tree

 main

/

sieveAlgo.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

38 lines (29 loc) · 872 Bytes

 main

/

sieveAlgo.java

Top

File metadata and controls

• Code
• Blame

38 lines (29 loc) · 872 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package maths;

import java.util.Arrays;

import java.util.Scanner;

public class sieveAlgo {

/**

* Implementation of Sieve Algorithm to find prime numbers upto N

*/

public static void main(String [] args){

System.out.println("Enter the range to find prime numbers");

Scanner sc = new Scanner(System.in);

int range = sc.nextInt();

boolean isPrime [] = sieveAlgo(range);

for(int i=0;i<=range;i++){

System.out.println(i+" is prime "+isPrime[i]);

}

}

static boolean[] sieveAlgo(int n){

boolean isPrime[] = new boolean[n+1];

Arrays.fill(isPrime, true);

isPrime[0] = false;

isPrime[1] = false;

for(int i=2;i*i<=n;i++){

for(int j=2;j<=n;j+=i){

isPrime[j] = false;

}

}

return isPrime;

}

}