Skip to content

Artemis: Optimize Prime Summation Logic #64

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
artemis-gen-ai wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Artemis: Optimize Prime Summation Logic #64

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 6 additions & 4 deletions src/algorithms/primes.cc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,12 +22,14 @@ Primes::IsPrime(int n) {
*
* @param n Upper bound (non-inclusive) of the sum
* @return The sum of all prime numbers from 0 to n
*/
*/
int
Primes::SumPrimes(int n) {
int sum = 0;
int sum = 2; // 2 is the first prime number

if (n <= 2) return 0; // No primes below 2

for (int i = 0; i < n; i += 1) {
for (int i = 3; i < n; i += 2) { // Start from 3 and check only odd numbers
if (IsPrime(i)) {
sum += i;
}
Expand All @@ -51,4 +53,4 @@ Primes::PrimeFactors(int n) {
}
}
return factors;
}
}