List Primes With a Sieve

Return all prime numbers from 2 through limit. A prime is an integer greater than 1 divisible only by 1 and itself. Use the sieve idea: keep the next unmarked number and mark its larger multiples as composite. List results in ascending order.

Implement sieve_primes(limit).

Input

limit: The largest number that may be included.

Output

Return the primes in ascending order, or an empty list if none exist.

Restricciones

0 ≤ limit ≤ 100,000. The upper bound is inclusive. Output tests verify results, not the exact algorithm used.

Ejemplos

Entrada:
limit = 12

Salida esperada:
expected = [2, 3, 5, 7, 11]

Entrada:
long long limit = 12;

Salida esperada:
std::vector<long long> expected = {2, 3, 5, 7, 11};

Entrada:
long limit = 12;

Salida esperada:
long[] expected = new long[] {2, 3, 5, 7, 11};

Entrada:
limit = 1

Salida esperada:
expected = []

Entrada:
long long limit = 1;

Salida esperada:
std::vector<long long> expected = {};

Entrada:
long limit = 1;

Salida esperada:
long[] expected = new long[] {};

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• Sieve