Apple-2-SW/EightBall
1
0
Fork 0
mirror of https://github.com/bobbimanners/EightBall.git synced 2024-06-01 06:41:33 +00:00
Code Issues Projects Releases Wiki Activity

Pasted other example code.

Browse Source
This commit is contained in:
Bobbi Webber-Manners 2018-05-01 11:50:24 -04:00 committed by GitHub
parent d6188ed911
commit 48a6f0f46c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 45 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

45
README.md
View File

@ -599,3 +599,48 @@ See `eightballvm.h` for technical details.
## Prime Number Sieve
Here is the well-known Sieve of Eratosthenes algorithm for finding prime numbers, written in EightBall:
' Sieve of Eratosthenes
' Globals
byte nr = 10
word n = nr * nr
byte A[100] = 1 ' Has to be a literal
pr.msg "Sieve of Eratosthenes ..."; pr.nl
call doall()
end
sub doall()
call sieve()
call printresults()
endsub
sub sieve()
word i = 0; word j = 0
for i = 2 : (nr - 1)
if A[i]
j = i * i
while (j < n)
A[j] = 0
j = j + i
endwhile
endif
endfor
endsub
sub printresults()
word i = 0
for i = 2 : (n - 1)
if A[i]
if i > 2
pr.msg ", "
endif
pr.dec i
endif
endfor
pr.msg "."
endsub