A simple yet very fast optimized version of the Segmented Sieve Algorithm based on the Sieve of Eratosthene
-
Updated
Oct 24, 2024 - C
A simple yet very fast optimized version of the Segmented Sieve Algorithm based on the Sieve of Eratosthene
segmented prime sieve. uses a sliding window accumulating primes in a binary file.discovering primes with impressive range.
rust implementation of window sieve a windowed prime sieve.
University project mainly involving Mersenne numbers.
Add a description, image, and links to the segmented-sieve topic page so that developers can more easily learn about it.
To associate your repository with the segmented-sieve topic, visit your repo's landing page and select "manage topics."