Sequence of primes by trial division: Difference between revisions

Content added Content deleted

Inline

@@ Line 2,853: / Line 2,853: @@
     if (count == limit) break
 }</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>
-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}}
@@ Line 2,899: / Line 2,877: @@
 1873 1877 1879 1889 1901 1907 1913 1931 1933 1949 1951 1973 1979 1987
 1997 1999 2003 2011 2017 2027 2029 2039 2053 2063 2069 2081 2083 2087
+</pre>
+=={{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>
+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>