/Sieve-of-Eratosthenes-algorithm

This code implements the Sieve of Eratosthenes algorithm to find prime numbers up to a given limit. It dynamically allocates memory for the boolean array to mark primes, iteratively marks multiples of prime numbers, and then prints out the prime numbers found.

Primary LanguageCMIT LicenseMIT

Sieve of Eratosthenes Algorithm

This code implements the Sieve of Eratosthenes algorithm to find prime numbers up to a given limit. It dynamically allocates memory for the boolean array to mark primes, iteratively marks multiples of prime numbers, and then prints out the prime numbers found.