Sieve of Eratosthenes: Difference between revisions

Content deleted Content added

Inline

@@ Line 9,717: / Line 9,717: @@
         List<Integer> primes = new ArrayList<Integer>(n);
         boolean[] isComposite = new boolean[n + 1];
-        for(int i = 2; i * i <= n; i++) {
+        for(int i = 2; i <= n; i++) {
             if(!isComposite[i]) {
                 primes.add(i);