Optimized and reworded the algorithm #92
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
hernajo2
changed the title
The new algorithm is more efficient and much easier for the user to read and to understand. This is now a useful function in order to calculate the factorization of prime numbers, with some errors that will show up if the number introduced by the user is not an integer higher than 1.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The new algorithm is not only more efficient than the previous one, but it is also much easier for the user to read and to understand. Basically, this is now a useful function in order to calculate the factorization of prime numbers. There are some erros that will show up if the number introduced by the user is not an integer higher than 1.