Primality by trial division: Difference between revisions

Content added Content deleted
(→‎Segmented Generate and Test: code tweak - about 10% slower cmpld, x4 faster interp'd in GHCi)
Line 493:
++ sieve (q+2) (head ps^2) (tail ps) (k+1)</lang>
 
Runs at empirical <math>O(n^{1.4541})</math> time complexity, in ''n'' primes produced. Can be used as a framework for unbounded segmented sieves, replacing divisibility testing with proper sieve of Eratosthenes etc.
 
=={{header|HicEst}}==
Retrieved from "https://rosettacode.org/wiki/Primality_by_trial_division"