Generating Prime Numbers: Reloaded

#computerscience #python

So This Again

After posting my previous post I got okay feedback, but there was a key problem. My method to getting prime numbers was wrong. So I decided to create an alternative method that I know is fool proof.

My working solution

So this solution is pretty simple so I'm sure that even beginners will understand(last time I wrote my code in c++, ruby, python, and js, this time only python).

The Code:

Takes user input and generates all the primes under it(including the number itself if it's prime)

How would you have done it?

Top comments (2)

Nam Hoang Le • Jun 7 '20

Some advice:

Your is_prime function has O(n) complexity. You can test only divisors in range [2, sqrt(n)] because if n has any divisor in range [sqrt(n), n) so it also has another in range [2, sqrt(n)].
You can use Sieve of Eratosthenes to solve your original problem. :)

Thorsten Hirsch • Jun 7 '20

Glad you've found the right approach. :-)

DEV Community

Generating Prime Numbers: Reloaded

So This Again

My working solution

The Code:

Takes user input and generates all the primes under it(including the number itself if it's prime)

Top comments (2)

Read next

Uncover Hidden Flaws: How Gap Analysis Can Revolutionize Your Software Testing Strategy

What Will You Choose?

Start with Python Dictionaries

How to Deploy a Fast API Application to a Kubernetes Cluster using Podman and Minikube