🚀 Fastest (probably) Sieve of Eratosthenes implementation, in C
-
Updated
Feb 6, 2020 - C
🚀 Fastest (probably) Sieve of Eratosthenes implementation, in C
Prime Number Generator - Fast and Simple - 64 Bit Numeric Range
Math library written in C++
Parallelized Sieve of Eratosthenes with Message Passing model.
Finds prime numbers in a specified range, fast.
Sieve of Eratosthenes implementation using pthreads in C
Some Personal C Projects
Fast prime generator
Parallel Sieve of Eratosthenes for prime numbers generation.
In this project we plan on parallelizing the Sieve of Eratosthenes, which is an algorithm for finding prime numbers.
A set of crypto tools and libraries
High performance palindromic prime number generator
Cyclop (C-lang - Consecutive List Of Primes)
segmented prime sieve. uses a sliding window accumulating primes in a binary file.discovering primes with impressive range.
Multithreaded implementation of the Segmented Sieve variant of Sieve of Eratosthenes
Prime sieve impementation.
Add a description, image, and links to the sieve-of-eratosthenes topic page so that developers can more easily learn about it.
To associate your repository with the sieve-of-eratosthenes topic, visit your repo's landing page and select "manage topics."