Artemis: Optimize Prime Checking and Factorization Logic #41
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.
This pull request implements optimizations to the
IsPrimeandPrimeFactorsmethods in thePrimesclass. Key changes include:Prime Checking Optimization: The loop in
IsPrimenow checks divisibility only up to the square root ofn, significantly reducing the number of iterations needed to determine if a number is prime.Enhanced Prime Factorization: The
PrimeFactorsmethod has been modified to handle repeated prime factors more effectively using awhileloop. Additionally, a check for any remaining prime factor greater than 1 has been added to ensure completeness in factorization.These improvements lead to better performance and efficiency when processing larger numbers.