161 results for “topic:sieve-of-eratosthenes”
🚀 Fast prime number generator
Code for various YouTube video lessons + extras
No description provided.
Demos of some algorithms & data structures in C++ using dummy command line apps.
Prime number library.
Various tools i created for my own use
Sieve Of Eratosthenes primes search algorithm implementation in Elixir
Kind of a proper guide from very basic to intermediate level for getting started with C++ programming.
EPR: A Factoring and Primality checking library for C++
The Turkish Sieve Methodology: Deterministic Computation of Twin and Cousin Prime Pairs Using an N/6 Bit Data Structure
🚀 Fastest (probably) Sieve of Eratosthenes implementation, in C
Prime Number Generator - Fast and Simple - 64 Bit Numeric Range
Algorithms useful for CS graduates
Pascal bindings for PrimeSieve library - https://github.com/kimwalisch/primesieve.
🏆 Golden Award for the Year of the Tiger Challenge, Golden Award Muad'Dib's Challenge: Dynamic programming, Greedy algorithms, Binary search, Fibonacci, Euclidean algorithm. Swift 4 @ S.Leschev. L5+
A fast, interactive tool to explore prime numbers visually — right in your browser.
All you need to save time :p
Math library written in C++
Comparing efficiency of prime number algorithms, including the Sieve of Eratosthenes and Trial Division, with different optimization techniques such as multiprocessing and GPU computing (CUDA).
A prime k-tuple finder based on the rug crate.
Parallelized Sieve of Eratosthenes with Message Passing model.
A blazingly fast Go program that finds all prime numbers up to a specified limit (e.g., 200,000,000) using a parallelized Segmented Sieve of Eratosthenes algorithm. It leverages Goroutines for concurrent sieving of number segments, offering dynamic load balancing.
This project compares the speed of different languages.
:neckbeard: OpenMP bit-level sieve of Eratosthenes
Fortran 95 implementation of the Sieve of Eratosthenes
Optimized for ARM64 (tested on Apple M1; expected to scale on M2/M3/M4).
A program to calculate the unit digit distribution of prime number upto a given limit
An extremely fast and efficient prime sieve
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.
Решение 20 алгоритмических задач на языке PHP. Полное описание всех задач и ссылки на исходный код с решениями - в Readme.md.