Advertisement
Guest User

NewPrimegen

a guest
Feb 13th, 2016
64
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.11 KB | None | 0 0
  1. private static void printPrimes (int N) {
  2. boolean[] primeArray = createArrayOfTrues(N);
  3. primeArray[0] = false;
  4. primeArray[1] = false;
  5.  
  6. for (int i = 0; i*i <= N; i++) {
  7. if (primeArray[i] == true) {
  8. for (int j = 1; j*i + i < N; j++) {
  9. primeArray[j*i + i] = false;
  10. }
  11. }
  12. }
  13. printArrayAsIntegers(primeArray);
  14. }
  15.  
  16. private static boolean[] createArrayOfTrues(int N) {
  17. boolean[] primeList;
  18. primeList = new boolean[N];
  19. for (int i = 0; i < N; i++) {
  20. primeList[i] = true;
  21. }
  22. return primeList;
  23. }
  24.  
  25. private static void printArrayAsIntegers(boolean[] numberList) {
  26.  
  27. int timesPrinted = 0;
  28. for (int i = 0; i < numberList.length; i++) {
  29. if (timesPrinted % 11 == 0) {
  30. System.out.println();
  31. timesPrinted ++;
  32. }
  33. if (numberList[i] != false) {
  34. System.out.print(i + "\t");
  35. timesPrinted ++;
  36. }
  37. }
  38. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement