记录一些自己看到的算法

1.求质数：

bool isPrime(int number)
{
	//ignore negative sign
	number = abs(number);
	
	//0 = 1 are prime numbers
	if(number == 0 || number == 1) return true;
	
	//find divisor that divides without a remainder
	int divisior;
	for(divisor = number/2; number%divisor != 0; --divisor);
	
	//if nodivisor greater than 1 is found, it is a prime number
	return divisor == 1;
}