Eratosthenes sieve in JavaScript

<<algorithm

 

prime

<!DOCTYPE html>
<html>
<body>
<script>

var n = prompt("n:", "");
var deleted = [], i, j;
if (n < 2) alert("No prime numbers in the given range");
else{
  for(i = 2; i <= n; i++) deleted[i] = false;
  i = 2;
  do{
    if (!deleted[i]){
      j = i * i;
      while(j <= n){
        deleted[j] = true;
        j += i;
      }
    }
    i++;
  } while ((i * i) <= n);
  for(i = 2; i <= n; i++) if (!deleted[i]) document.write(i+" ");
}

</script> 
</body>
</html>
 

 

Facebook Twitter Linkedin