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

Minor optimization.

Browse Source
This commit is contained in:
Nicolás A. Ortega Froysa
2016-12-14 15:55:39 +01:00
parent d8c81b172b
commit b414bff9dc
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
src/main.c
View File

@@ -42,8 +42,7 @@ int main(void) {
// Calculate half of `num' // Calculate half of `num'
mpz_fdiv_q_ui(halfNum, num, 2); mpz_fdiv_q_ui(halfNum, num, 2);
// Loop through found primes // Loop through found primes
for(size_t i = 0; i < primes.end; ++i) { for(size_t i = 0; mpz_cmp(primes.list[i], halfNum) < 0; ++i) {
if(mpz_cmp(primes.list[i], halfNum) > 0) break;
// If `num' is divisible by a prime then go to the next number // If `num' is divisible by a prime then go to the next number
if(mpz_divisible_p(num, primes.list[i]) != 0) if(mpz_divisible_p(num, primes.list[i]) != 0)
goto nextPrime; goto nextPrime;