Program by:
Ravi Sharma
(rvisharma)
Prime-Number-Finder-using-Sieve-of-Eratosthenes
===============================================
Finds Prime Numbers using Sieve of Eratosthenes Algorithm
This Program gives you the prime number upto N Integers,
Sieve of Eratosthenes Algorithm is used to determine the
Prime Number
To find the Prime Number, in the console Shell
call the prime_finder(N) function, prime number will
be given upto N integer.
At first you will be prompted with an input, after that you can call it using
function prime_finder(n)
example call:
>>>prime_finder(10)
#output
[2,3,5,7]
(Int) -> (list)
Categories
AlgorithmsOther Useful Business Software
Build Securely on Azure with Proven Frameworks
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Prime-Number-Finder!