Segmented sieve of Eratosthenes

Правка en2, от matcoder, 2018-08-25 08:41:47

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

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский matcoder 2018-08-25 08:44:48 2 Tiny change: 'log(n)))\nSpace co' -> 'log(n)))\n\nSpace co'
en2 Английский matcoder 2018-08-25 08:41:47 15
en1 Английский matcoder 2018-08-25 08:40:37 281 Initial revision (published)