Sequence of primes by trial division: Difference between revisions
Content added Content deleted
(Added XPL0 example.) |
|||
Line 2,853: | Line 2,853: | ||
if (count == limit) break |
if (count == limit) break |
||
}</lang> |
}</lang> |
||
=={{header|XPL0}}== |
|||
<lang XPL0>func IsPrime(N); \Return 'true' if N is prime |
|||
int N, I; |
|||
[if N <= 2 then return N = 2; |
|||
if (N&1) = 0 then \even >2\ return false; |
|||
for I:= 3 to sqrt(N) do |
|||
[if rem(N/I) = 0 then return false; |
|||
I:= I+1; |
|||
]; |
|||
return true; |
|||
]; |
|||
int N; |
|||
for N:= 2 to 100 do |
|||
if IsPrime(N) then |
|||
[IntOut(0, N); ChOut(0, ^ )]</lang> |
|||
{{out}} |
|||
<pre> |
|||
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 |
|||
</pre> |
|||
{{out}} |
{{out}} |