Playing around with different algorithms to find out the first n prime number. Some of the mechanisms used are simple implementations of Eratosthenes sieve, sundaram algorithm, and square root division. Tried different containers, mostly vectors (and lists) to see if performance improves.
-
Notifications
You must be signed in to change notification settings - Fork 0
kasinv-zz/Prime-Numbers
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
preliminary tests, code for different prime number algorithms
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published