C语言之判断一个数是否为素数

#include "stdio.h"
#include"time.h"
#include"math.h"

int isPrime(int number) {
    for (int i = 2; i * i <= number; i++)
        if (number % i == 0)
            return 0;
    return 1;
}

int isPrime(int number) {
    for (int i = 2; i * i <= number; i++)
        if (number % i == 0)
            return 0;
    return 1;
}

int main() {
    long start = time(NULL);
    printf("%d\n", isPrimeNumber(29));
    printNum(100);
    printf("\n");
    long end = time(NULL);
    printf("Time spent: %d", end - start);
}

运行结果:

1
2         3         5         7         11        13        17        19        23        29        
31        37        41        43        47        53        59        61        67        71        
73        79        83        89        97        
Time spent: 0