Sequence of primes by trial division: Difference between revisions

Content added Content deleted

Inline

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