Skip to content

CBelford/Primes

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Test solution.  It is a quick coding solution showing two ways to find all prime numbers in a given range, and which allows comparison to be run between the two methods to see differences in speed.

About

Really basic code for determining prime numbers in a range. One full brute force method, and then a slightly smarter brute force method.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages