Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- <!--
- An implementation of Sieve of Eratosthenes using a boolean array
- Author: Nguyen Thanh Do
- -->
- <!DOCTYPE html>
- <html>
- <head>
- <title>Sieve of Eratosthenes</title>
- </head>
- <body>
- <h3>Sieve of Eratosthenes</h3>
- <input type="number" id="input-number">
- <p>Click the button to submit the limit</p>
- <button onclick="show()">Submit</button>
- <p id="output-intro"> </p>
- <p id="output-numbers"></p>
- </body>
- <script>
- let limit;
- let notPrime;
- let result;
- let sentence;
- function getInput() {
- limit = document.getElementById("input-number").value;
- }
- function markPrimes() {
- notPrime = new Array(parseInt(limit) + 1).fill(false);
- notPrime[0] = notPrime[1] = true;
- for (let num = 4; num <= limit; num += 2)
- notPrime[num] = true;
- for (let num = 3; num <= Math.sqrt(limit); num +=2) {
- if (notPrime[num] === false) {
- for (let mul = num * num; mul <= limit; mul += num * 2)
- notPrime[mul] = true;
- }
- }
- }
- function printPrimes() {
- sentence = "List of prime numbers from 1 to " + (String(limit) + ": ");
- result = '';
- for (let num = 0; num <= limit; num++) {
- if (notPrime[num] === false)
- result += (String(num) + ' ');
- }
- document.getElementById("output-intro").innerHTML = sentence;
- document.getElementById("output-numbers").innerHTML = result;
- }
- function noPrime() {
- sentence = "There is no prime number. Please enter a number greater than or equal to 2";
- result = '';
- document.getElementById("output-intro").innerHTML = sentence;
- document.getElementById("output-numbers").innerHTML = result;
- }
- function show() {
- getInput();
- if (limit < 2) {
- noPrime();
- }
- else {
- markPrimes();
- printPrimes();
- }
- }
- </script>
- </html>
Advertisement
Add Comment
Please, Sign In to add comment