Skip to content
This repository was archived by the owner on Sep 7, 2025. It is now read-only.

Conversation

bilalcancode
Copy link
Contributor

We can find the prime number by running only to the half of the number entered. In this way the running time can be decreased. Also we can use bool variable to keep track of prime number rather than integer which is more memory efficient

I am creating a pull request for...

  • Update to an algorithm
We can find the prime number by running only to the half of the number entered. In this way the running time can be decreased. Also we can use bool variable to keep track of prime number rather than integer which is more memory efficient
Copy link
Member

@abranhe abranhe left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks so much for your contribution to The All ▲lgorithms Project. Without people like you submitting Pull Requests we couldn't run this project. You rock!

@abranhe abranhe merged commit 4dbd283 into AllAlgorithms:master Nov 7, 2020
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.

Labels

None yet

2 participants