Segmented sieve of Eratosthenes
Difference between en1 and en2, changed 15 character(s)
Segmented sieve of Eratosthenes can be used to evaluate prime numbers less than n, where n is large enough in pretty less time and memory.↵
↵
↵
Time complexity: O(n.log(log(n)))↵
Space complexity: O(sqrt(n))↵
↵
_Link_:↵
↵
https://primesieve.org/segmented_sieve.html

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English matcoder 2018-08-25 08:44:48 2 Tiny change: 'log(n)))\nSpace co' -> 'log(n)))\n\nSpace co'
en2 English matcoder 2018-08-25 08:41:47 15
en1 English matcoder 2018-08-25 08:40:37 281 Initial revision (published)