Graphical Sieve of Eratosthenes
| Author's name: | Alan Eliasen |
| Author's web site: | http://futureboy.homeip.net/ |
Description:
This is an implementation of the Sieve of Eratosthenes to find prime numbers. It overcomes the limitations of arrays in Level I BASIC by using graphical memory to keep track of the numbers. This program can find all prime numbers less than 6143. Data is saved to "tape" (because printing would destroy the data as we're reading) and then reloaded to print out the numbers. (I think I did LPRINT to save the data back in the old days.)