nortega/indivisible-legacy
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Don't test for divisibility by 2.

Browse Source 
We skip all even numbers, so we can skip 2, this also means giving 3 as
a given.
This commit is contained in:
Nicolás A. Ortega Froysa
2016-12-30 17:57:28 +01:00
parent 3e902efd18
commit f8726497a4
1 changed files with 12 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
src/main.c
View File

@@ -116,12 +116,16 @@ int main(int argc, char *argv[]) {
fprintf(stderr, "Failed to allocate more memory for list.\n");
goto releaseMemory;
}
if(!f_quiet) {
if(mpz_out_str(stdout, base, num) == 0)
fprintf(stderr, "Could not print to `stdout'!\n");
printf("\n");
// Add 3 as well to optimize the algorithm
mpz_set_ui(num, 3);
if(addToList(&primes, num) == 1) {
fprintf(stderr, "Failed to allocate more memory for list.\n");
goto releaseMemory;
}
mpz_add_ui(num, num, 1);
if(!f_quiet) {
puts("2\n3");
}
mpz_add_ui(num, num, 2);
} else {
// Load primes from file
int err = inputPrimes(file, &primes);
@@ -167,9 +171,10 @@ int main(int argc, char *argv[]) {
mpz_fdiv_q_ui(halfNum, num, 2);
/**
* Loop through primes we've found until we get to half of the number
* we're analyzing
* we're analyzing. Also, skip `2' since we're not testing even
* numbers.
*/
for(size_t i = 0; mpz_cmp(primes.list[i], halfNum) < 0; ++i) {
for(size_t i = 1; mpz_cmp(primes.list[i], halfNum) < 0; ++i) {
// If `num' is divisible by a prime then go to the next number
if(mpz_divisible_p(num, primes.list[i]) != 0)
goto nextNum;