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
Gen AI apps are built with MongoDB Atlas
MongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Prime-Number-Finder!