Multi-thread C++ program to find all prime numbers < N

In this article, we have developed a Multi-thread C++ program to find all prime numbers

Introduction

There are many ways to generate prime numbers.

In this article we will focus on the Sieve or Eratosthenes, which has been implemented in this article too.

The downsize of this approach is that for each number, the algorithm waits to finish the marked numbers of the predecessor prime number;

Could we do that in parallel ?

A way of implementation

My approach is to use a matrix with N lines and 2 c...