Most efficient code for the first 10000 prime numbers?

by

The Sieve of Atkin is probably what you’re looking for, its upper bound running time is O(N/log log N).

If you only run the numbers 1 more and 1 less than the multiples of 6, it could be even faster, as all prime numbers above 3 are 1 away from some multiple of six.
Resource for my statement

More Related Contents:

  1. High-performance merging of ordered sets
  2. How to find the kth largest element in an unsorted array of length n in O(n)?
  3. Recursion or Iteration?
  4. How to speed up A* algorithm at large spatial scales?
  5. nth fibonacci number in sublinear time
  6. Algorithm to calculate the number of divisors of a given number
  7. What would be the fastest method to test for primality in Java?
  8. What is the fastest way to get the value of π?
  9. What are the rules for the “Ω(n log n) barrier” for sorting algorithms?
  10. Find number in sorted matrix (Rows n Columns) in O(log n) [duplicate]
  11. Has anyone actually implemented a Fibonacci-Heap efficiently?
  12. How to find pair with kth largest sum?
  13. I am looking for a simple algorithm for fast DCT and IDCT of matrix [NxM]
  14. Move all odd positioned element to left half and even positioned to right half in-place
  15. How can Google be so fast?
  16. Why is my Rust program slower than the equivalent Java program?
  17. Clear file cache to repeat performance testing
  18. What’s the (hidden) cost of Scala’s lazy val?
  19. Given n points on a 2D plane, find the maximum number of points that lie on the same straight line
  20. Is Mongodb Aggregation framework faster than map/reduce?
  21. Fast vectorized rsqrt and reciprocal with SSE/AVX depending on precision
  22. Speed-efficient classification in Matlab
  23. Fast algorithm implementation to sort very small list
  24. How Do I Measure the Performance of my AngularJS app’s digest Cycle?
  25. Is it useful to use VZEROUPPER if your program+libraries contain no SSE instructions?
  26. Hash Set and Array List performances
  27. SUMIFS function in Google Spreadsheet
  28. Performance of using static methods vs instantiating the class containing the methods
  29. Given Prime Number N, Compute the Next Prime?
  30. How can the rep stosb instruction execute faster than the equivalent loop?

Leave a Comment