sieve_of_eratosthenes.hk

//
// sieve_of_eratosthenes.hk
//

import { new_array } from arrays;

fn sieve_of_eratosthenes(n) {
  var prime = new_array(n + 1);
  var i;
  i = 0;
  while (i < n + 1) {
    prime[] = true;
    i++;
  }
  i = 2;
  while (i * i <= n) {
    if (prime[i]) {
      var j = i * 2;
      while (j <= n) {
        prime[j] = false;
        j += i;
      }
    }
    i++;
  }
  i = 2;
  while (i <= n) {
    if (prime[i])
      println(i);
    i++;
  }
}

let n = 100;
sieve_of_eratosthenes(n);