Sieve of Eratosthenes: Difference between revisions

Content deleted Content added

Inline

@@ Line 5,706: / Line 5,706: @@
 =={{header|EasyLang}}==
-<syntaxhighlight lang="text">len prims[] 100
+<syntaxhighlight lang="text">
+len divisible[] 100
-max = sqrt len prims[]
+max = sqrt len divisible[]
-tst = 2
-while tst <= max
+for tst = 2 to max
-  if prims[tst] = 0
+  if divisible[tst] = 0
     i = tst * tst
-    while i < len prims[]
+    while i <= len divisible[]
-      prims[i] = 1
+      divisible[i] = 1
       i += tst
     .
   .
-  tst += 1
 .
+for i = 2 to len divisible[]
-i = 2
+  if divisible[i] = 0
-while i < len prims[]
-  if prims[i] = 0
     print i
   .
+.
-  i += 1
-.</syntaxhighlight>
+</syntaxhighlight>
 =={{header|eC}}==