How can I optimize my Python prime number generator for speed and accuracy?

Prime Number Generator in Python

This Python code aims to generate prime numbers, but it requires some adjustments for optimal functionality.

The corrected code below:

import math

def main():
    count = 3

    while True:
        is_prime = True

        for x in range(2, int(math.sqrt(count) + 1)):
            if count % x == 0:
                is_prime = False
                break

        if is_prime:
            print(count)

        count += 1

Issues and Corrections:

1. Printing Issue: The original code printed count even when it wasn't prime. This was because it was printing on the if count % x != 0 condition, which didn't ensure primality. The corrected code prints only when is_prime is True.
2. Loop Control: The continue statement in the original code skipped the loop iteration when the condition was met, but it should have terminated the iteration using break to process the next number.
3. Efficiency: Manually checking divisibility for each number can be inefficient for large numbers. The corrected code uses the Sieve of Eratosthenes, which is much more efficient for prime generation.

The above is the detailed content of How can I optimize my Python prime number generator for speed and accuracy?. For more information, please follow other related articles on the PHP Chinese website!