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.

Contraintes

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

Exemples

Entrée :
limit = 12

Sortie attendue :
expected = [2, 3, 5, 7, 11]

Entrée :
long long limit = 12;

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

Entrée :
long limit = 12;

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

Entrée :
limit = 1

Sortie attendue :
expected = []

Entrée :
long long limit = 1;

Sortie attendue :
std::vector<long long> expected = {};

Entrée :
long limit = 1;

Sortie attendue :
long[] expected = new long[] {};

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• Sieve