export function sieveOfEratosthenes(n: number): number[] {
  // Escribe tu solución aquí
  let result: Array<number> = [];

  for (let i = 0; i <= n; i++) {
    if (isPrime(i)) {
      result.push(i);
    }
  }

  return result;
}

function isPrime(num: number): boolean {
  if (num < 2) return false;
  if (num == 2) return true;

  for (let i = 2; i * i <= num; i++) {
    if (num % i === 0) return false;
  }
  return true;
}