This Angular app implements the Sieve of Eratosthenes algorithm to filter out prime numbers. The Sieve of Eratosthenes is a simple and efficient algorithm for finding all prime numbers up to a given limit.
Allows users to generate a list of prime numbers up to a given limit Displays the generated list of prime numbers in a table
To use the app, enter the desired limit in the input field and click on the Submit button, Click on the Filter Prime button. The app will display two separate sections one that lists all of the numbers and then the other one (Prime Numbers) section will have all of the prime numbers up to the requested limit.
