判断一个数字是否为质数-------摘自《C++标准程序库》

<textarea cols="50" rows="15" name="code" class="cpp">bool IsPrime(int number) { number = abs(number); if (0 == number || 1 == number) { return true; } int divisor; for (divisor = number/2; number%divisor != 0; --divisor) { } return 1 == divisor; }</textarea>