By - Ravi R Sharma [email protected]
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)