calculate and display prime numbers with fast execution time for given input number range.
-
Updated
Feb 13, 2024 - C
calculate and display prime numbers with fast execution time for given input number range.
In this project we plan on parallelizing the Sieve of Eratosthenes, which is an algorithm for finding prime numbers.
Add a description, image, and links to the prime-number-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the prime-number-algorithm topic, visit your repo's landing page and select "manage topics."