Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <primes_slow.h>
Static Public Member Functions | |
template<typename BaseType > | |
static bool | isPrime (BaseType p) |
Very naive implementation of primality testing.
static bool math::primes::PrimesSlow::isPrime | ( | BaseType | p | ) | [inline, static] |
Checks whether a specified number is prime
p | number to be tested |