Rosetta Code

Sisyphus sequence: Difference between revisions

Page Discussion

Sisyphus sequence (view source)

Revision as of 18:42, 20 September 2023

4 bytes removed ,  7 months ago
m
Corrected spelling mistake.
m (Reformatted the output.)
m (Corrected spelling mistake.)
Line 344:
 
=={{header|Java}}==
Using a segmented prime sieveiterator enables the extreme stretch task to be completed in approximately 70 minutes without using any external libraries.
<syntaxhighlight lang="java">
import java.util.ArrayList;
Line 436:
final class SegmentedPrimeIterator {
public SegmentedPrimeIterator(long aLimitlimit) {
squareRoot = (int) Math.sqrt(aLimitlimit);
high = squareRoot;
smallSieve(squareRoot);
Line 476:
}
private void smallSieve(int aSquareRootsquareRoot) {
boolean[] markedPrime = new boolean[aSquareRootsquareRoot + 1];
Arrays.fill(markedPrime, true);
for ( int p = 2; p * p <= aSquareRootsquareRoot; p++ ) {
if ( markedPrime[p] ) {
for ( int i = p * p; i <= aSquareRootsquareRoot; i += p ) {
markedPrime[i] = false;
}
Line 488:
}
for ( int p = 2; p <= aSquareRootsquareRoot; p++ ) {
if ( markedPrime[p] ) {
primes.add((long) p);
PSNOW123
871

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/358637"