Nice primes: Difference between revisions
Content added Content deleted
(→{{header|PL/M}}: Optimise the sieve by using the SQRT routine from the PL/M solution to the Frobenius Numbers task) |
(→{{header|PL/M}}: Bug fix) |
||
Line 1,006: | Line 1,006: | ||
SQRT: PROCEDURE( N )ADDRESS; |
SQRT: PROCEDURE( N )ADDRESS; |
||
DECLARE ( N, X0, X1 ) ADDRESS; |
DECLARE ( N, X0, X1 ) ADDRESS; |
||
IF N <= 3 THEN |
IF N <= 3 THEN DO; |
||
IF N = 0 THEN X0 = 0; ELSE X0 = 1; |
|||
END; |
|||
ELSE DO; |
ELSE DO; |
||
X0 = SHR( N, 1 ); |
X0 = SHR( N, 1 ); |