Simple, straightforward algorithm (incomplete version)

Determining whether a number is a prime number

bool isPrime(int num) {
    for (int i = 2; i * i <= num; ++i) {
        if (num % i == 0)
            return false;
    }
    return (num != 1); /* 1不为素数 */
}

Will slowly update ...