Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class PrimeNumbers {
- private boolean[] nbrType;
- private int nbr;
- public PrimeNumbers(int nbr) {
- nbrType = new boolean[nbr + 1];
- this.nbr = nbr;
- nbr = nbrType.length;
- for (int i = 0; i < nbrType.length; i++) {
- nbrType[i] = true;
- }
- }
- public void calculation() {
- for (int i = 2; i < nbr; i++) {
- if (nbrType[i]) {
- for (int k = 2; k < nbr; k++) {
- if (k * i < nbr && k * i > 0) {
- nbrType[k * i] = false;
- }
- }
- }
- }
- for (int j = 2; j < nbr; j++) {
- if (nbrType[j])
- System.out.println(j);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement