🚀 Fast prime number generator
-
Updated
Feb 24, 2025 - C++
🚀 Fast prime number generator
Demos of some algorithms & data structures in C++ using dummy command line apps.
Various tools i created for my own use
Kind of a proper guide from very basic to intermediate level for getting started with C++ programming.
Algorithms useful for CS graduates
EPR: A Factoring and Primality checking library for C++
All you need to save time :p
OpenMP bit-level sieve of Eratosthenes
A program to calculate the unit digit distribution of prime number upto a given limit
Generate ulam spirals 🌀
C++ implementation of the eratosthenes sieve using control and data parallelism.
Finding Primes Numbers Using Sieve of Eratosthenes Algorithm
From basic algorithms like Sieve, Bitwise-sieve, Segmnted-sieve, Modular Arithmetic, Big Mod to Primality test, CRT etc. all other advance number theory algorithms.
A learning project that implements an algorithm for finding prime numbers, in several widely-used programming languages, running natively or as containers in multiple environments.
Parallel Sieve of Eratosthenes written in C++ with OpenMP
Fast small primes generator
All experiments performed as part of CEE82A - High Performance Computing.
University project mainly involving Mersenne numbers.
A twin prime calculator implementing the Sieve of Eratosthenes with concurrency implemented through OpenMP
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."