We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 4284a04 + 0e23b7c commit f9c1606Copy full SHA for f9c1606
code.md
@@ -396,10 +396,11 @@ long long int loops = 0;
396
397
int is_prime(int i) {
398
int is_first = 1;
399
- for (int j = 2; j*j < i; j++) {
+ for (int j = 2; j*j <= i; j++) {
400
loops++;
401
if (i % j == 0) {
402
is_first = 0;
403
+ break;
404
}
405
406
return is_first;
@@ -417,7 +418,7 @@ int main(int argc, char **argv) {
417
418
419
i++;
420
- printf("The 100001st prime number is %d\n", hold);
421
+ printf("Prime number %d is %d\n", max_prime, hold);
422
printf("Number of loops: %lld\n", loops);
423
return 0;
424
0 commit comments