JavaScript

JavaScript is essentially identical to Java, except variables are typeless, arrays have no dimension, and the usual java framing is omitted.

This code compiles and runs in Internet Explorer 7, and will probably execute correctly in most modern browsers. Click on the link below to execute the script. To see the source, right click and select "View Source" while the results are being displayed.

<html> <head> <title>Javascript Sourcecode</title> </head> <body> <h1>Javascript Sourcecode</h1> <h2>Right-Click and select "View Source" to see source code.</h2> <p> <script type="text/javascript"> var Candidates = new Array() for (i=0 ; i<1000 ; i++) { // everything is potentially prime until proven otherwise Candidates[i] = 1; } // Neither 1 nor 0 is prime, so flag them off Candidates[0] = 0; Candidates[1] = 0; // start the sieve with the integer 0 i = 0; while (i<1000) { // advance to the next un-crossed out number. // this number must be a prime while (i<1000 && Candidates[i] == 0) { i++; } // insure against running off the end of the data structure if (i<1000) { // cross out all multiples of the prime, starting with 2*p. for (j=2 ; j*i < 1000 ; j++) { Candidates[j*i] = 0; } // advance to the next candidate i++; } } // all uncrossed-out numbers are prime (and only those numbers) // print all primes for (i=0 ; i<1000 ; i++) { if (Candidates[i] != 0) { document.write( i ," is prime<br>"); } } </script> </p> </body> </html>

Click Here for the actual code.