Advertisement
Guest User

Prime

a guest
Nov 23rd, 2014
135
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.57 KB | None | 0 0
  1. public class PrimeNumbers {
  2. private boolean[] nbrType;
  3. private int nbr;
  4.  
  5. public PrimeNumbers(int nbr) {
  6. nbrType = new boolean[nbr + 1];
  7. this.nbr = nbr;
  8. nbr = nbrType.length;
  9. for (int i = 0; i < nbrType.length; i++) {
  10. nbrType[i] = true;
  11. }
  12. }
  13.  
  14. public void calculation() {
  15. for (int i = 2; i < nbr; i++) {
  16. if (nbrType[i]) {
  17. for (int k = 2; k < nbr; k++) {
  18. if (k * i < nbr && k * i > 0) {
  19. nbrType[k * i] = false;
  20. }
  21. }
  22. }
  23. }
  24.  
  25. for (int j = 2; j < nbr; j++) {
  26. if (nbrType[j])
  27. System.out.println(j);
  28. }
  29. }
  30.  
  31. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement