Which is the fastest algorithm to find prime numbers?

by

A very fast implementation of the Sieve of Atkin is Dan Bernstein’s primegen. This sieve is more efficient than the Sieve of Eratosthenes. His page has some benchmark information.

More Related Contents:

  1. Determining if a number is prime
  2. Printing prime numbers from 1 through 100
  3. Fastest algorithm for primality test [closed]
  4. Insertion sort stops working after million input
  5. How to find out how many bits are set (equal 1) in the product of two integers [closed]
  6. C++ – Find numbers between first and last negative numbers in Array
  7. Program stopped working, when tried to run
  8. C++ throwing exception in recursive algorithm
  9. How to use Quick Sort to sort an array of strings
  10. How to get the maximum number after erasing n digits from the number [closed]
  11. Calculating pow(a,b) mod n
  12. How to find which elements are in the bag, using Knapsack Algorithm [and not only the bag’s value]?
  13. Lock-free Progress Guarantees in a circular buffer queue
  14. Getting the actual length of a UTF-8 encoded std::string?
  15. Emulate “double” using 2 “float”s
  16. Algorithm for finding the smallest power of two that’s greater or equal to a given value [duplicate]
  17. How can I find the actual path found by BFS?
  18. Need for predictable random generator
  19. Splitting a string by a character
  20. How can I sort a std::map first by value, then by key?
  21. what is the difference between set and unordered_set in C++?
  22. Similar String algorithm
  23. Calculating the Amount of Combinations
  24. Better shading on BW display while rendering filled surfaces
  25. How can I sort an STL map by value?
  26. Algorithm to add or subtract days from a date?
  27. Creating N nested for-loops
  28. How to find Longest Common Substring using C++
  29. Mapping elements in 2D upper triangle and lower triangle to linear structure
  30. Generate N random numbers within a range with a constant sum

Leave a Comment