Sequence of primes by trial division: Difference between revisions

Content added Content deleted

Inline

@@ Line 827: / Line 827: @@
 =={{header|EasyLang}}==
 <syntaxhighlight lang="easylang">
-func isPrime num . result$ .
+proc isPrime num . result .
+   result = 0
    if num < 2
-      result$ = "false"
       break 1
    .
    if num mod 2 = 0 and num > 2
-      result$ = "false"
       break 1
    .
-   for i = 3 to sqrt num
+   for i = 3 step 2 to sqrt num
       if num mod i = 0
-         result$ = "false"
          break 2
       .
    .
-   result$ = "true"
+   result = 1
 .
-func primeSequence first last . sequence[] .
+proc primeSequence first last . sequence[] .
    for i = first to last
-      call isPrime i result$
+      call isPrime i result
-      if result$ = "true"
+      if result = 1
          sequence[] &= i
       .
    .
 .
+call primeSequence 1 100 seq[]
+print seq[]
 </syntaxhighlight>