Efficient Prime Number Generator

By: fyvo July 31, 2025 Python

Description

This code implements a highly optimized algorithm to generate prime numbers up to a specified limit. It uses the Sieve of Eratosthenes for efficient prime number detection.

Code Snippet

def sieve_of_eratosthenes(limit):
    primes = [True] * (limit + 1)
    primes[0] = primes[1] = False
    for i in range(2, int(limit**0.5) + 1):
        if primes[i]:
            for j in range(i * i, limit + 1, i):
                primes[j] = False
    prime_numbers = [i for i, is_prime in enumerate(primes) if is_prime]
    return prime_numbers

limit = 100
prime_numbers = sieve_of_eratosthenes(limit)
print(f"Prime numbers up to {limit}: {prime_numbers}")

Discussion (0)