Fortran 95 implementation of the Sieve of Eratosthenes

A collection of the most famous algorithms implemented in Typescript

A list of practical projects that anyone can solve in any programming language. These projects are divided in multiple categories.

Sieve of Eratosthenes in C++

A simple yet very fast optimized version of the Segmented Sieve Algorithm based on the Sieve of Eratosthene

1: O crivo de Eratóstenes é um algoritmo usado para identificar números primos. O algoritmo (apresentado aqui da maneira mais simples) primeiro declara um array de N posições de valores booleanos, todos iguais a true (considerando que em princípio qualquer número pode ser primo). O algoritmo, em seguida, marca todos os elementos do array cujos í…

C++ implementation of the Sieve of Eratosthenes algorithm

Solution to HackerRank "twins" problem in mathematics/Number Theory section

Implementation of eratosthenes sieve in Groovy.

Eratosthenes sieve with mono and multi threads

implementation of the Sieve of Eratosthenes algorithm to calculate prime integers.

Sieve of Eratosthenes in Python 2 and Python 3

Trying out various optimizations on the well-known Eratosthenes algorithm and alternatives. Including coroutines and RxJava.

Data Structures II - Exercise 1 from Roteiro de Laboratório 1 – Aquecimento.

Optimus prime - Basic algorithm assignment

Here I upload my code solutions written for university or some competitions

This python library contains some useful functions to deal with prime numbers and whole numbers. Contact over my youtube-channel :

C# : Nombres premiers avec crible d' Atkin et Eratosthène et test de primalité Miller Rabin ( C #: Prime numbers with Atkin and Eratosthenes sieve and Miller Rabin primality test )

Implementação do crivo de eratostenes serial e paralelo.