An incremental primal sieve
- Cite this article as:
- Bengelloun, S.A. Acta Informatica (1986) 23: 119. doi:10.1007/BF00289493
- 37 Downloads
A new algorithm is presented for finding all primes between 2 and an incrementally increasing value n. The algorithm executes in linear arithmetic time and space. An outline is given to show how previously developed techniques can be applied to improve the efficiency of the algorithm to O(n/loglogn) time and space.