Advertisement
Guest User

Untitled

a guest
Dec 17th, 2017
70
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.89 KB | None | 0 0
  1. enum Mark{ UNMARKED, PRIME, NOTPRIME};
  2.  
  3. public class Eratosthenes {
  4. public static int[] sieve( int n ) {
  5. int[] primes = new int[];
  6. Mark[] mark = new Mark[];
  7.  
  8. mark[0] = Mark.NOTPRIME;
  9. mark[1] = Mark.NOTPRIME;
  10.  
  11. for (int k = 2; k <= n; k++ ) {
  12. mark[k] = Mark.UNMARKED;
  13. }
  14.  
  15. for (int i = 2; i <= n; i++) {
  16. for (int j = 2; j <= n / i; j++) {
  17. int notprime = i * j;
  18. mark[notprime] = Mark.NOTPRIME;
  19.  
  20. }
  21. }
  22. for (int l = 2; l <= n; l++) {
  23. if ( mark[l] == Mark.UNMARKED) {
  24. mark[l] = Mark.PRIME;
  25. l = primes;
  26.  
  27.  
  28. }
  29. }
  30. return primes;
  31. }
  32. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement