/primesThreading

Find primes faster using threads

Primary LanguageC++

(The millerRabin branch is much faster)

Threaded Prime Compairason

The code just counts the number of prime numbers up to n.

Dependencies

  1. gcc (or any other c++ compiler)

  2. cmake

  3. make

sudo apt install make cmake build-essential -y

Compiling

$ mkdir build
$ cd build
$ cmake ../
$ make

Running

Run the executable in the bin folderand specify up to what term you wanna calculate

./primeT.o number or ./primeN.o number