Sequence of primes by trial division: Difference between revisions
Content added Content deleted
VincentARM (talk | contribs) (add task to arm assembly raspberry pi) |
|||
Line 947: | Line 947: | ||
=={{header|EasyLang}}== |
=={{header|EasyLang}}== |
||
<syntaxhighlight lang="easylang"> |
<syntaxhighlight lang="easylang"> |
||
func prime n . |
|||
proc isPrime num . result . |
|||
if n mod 2 = 0 and n > 2 |
|||
return 0 |
|||
⚫ | |||
. |
. |
||
i = 3 |
|||
⚫ | |||
while i <= sqrt n |
|||
⚫ | |||
. |
|||
return 0 |
|||
if num mod i = 0 |
|||
break 2 |
|||
. |
. |
||
⚫ | |||
. |
. |
||
return 1 |
|||
. |
. |
||
proc |
proc primeSequ first last . sequ[] . |
||
for i = first to last |
for i = first to last |
||
if prime i = 1 |
|||
sequ[] &= i |
|||
sequence[] &= i |
|||
. |
. |
||
. |
. |
||
. |
. |
||
primeSequ 2 100 seq[] |
|||
print seq[] |
print seq[] |
||
</syntaxhighlight> |
</syntaxhighlight> |