Skip to content

java-parallelism-examples/Primes

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Primes Computation
------------------
This application computes a set of all primes smaller than a given n.

The algorithm is naive, checking for each number whether it
divides with 2 or odd numbers smaller then it.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages