Strong and weak primes: Difference between revisions
Content added Content deleted
m (Minor edit to C++ code) |
m (C++ - renamed class) |
||
| Line 309: | Line 309: | ||
#include <locale> |
#include <locale> |
||
#include <sstream> |
#include <sstream> |
||
#include " |
#include "prime_sieve.hpp" |
||
int main() { |
int main() { |
||
| Line 318: | Line 318: | ||
// find the prime numbers up to array_size |
// find the prime numbers up to array_size |
||
prime_sieve sieve(array_size); |
|||
// write numbers with groups of digits separated according to the system default locale |
// write numbers with groups of digits separated according to the system default locale |
||
| Line 356: | Line 356: | ||
}</lang> |
}</lang> |
||
Contents of |
Contents of prime_sieve.hpp: |
||
<lang cpp>#ifndef |
<lang cpp>#ifndef PRIME_SIEVE_HPP |
||
#define |
#define PRIME_SIEVE_HPP |
||
#include <algorithm> |
#include <algorithm> |
||
| Line 367: | Line 367: | ||
* See https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes. |
* See https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes. |
||
*/ |
*/ |
||
class |
class prime_sieve { |
||
public: |
public: |
||
explicit |
explicit prime_sieve(size_t); |
||
bool is_prime(size_t) const; |
bool is_prime(size_t) const; |
||
private: |
private: |
||
| Line 380: | Line 380: | ||
* @param limit the maximum integer that can be tested for primality |
* @param limit the maximum integer that can be tested for primality |
||
*/ |
*/ |
||
inline |
inline prime_sieve::prime_sieve(size_t limit) { |
||
limit = std::max(size_t(3), limit); |
limit = std::max(size_t(3), limit); |
||
is_prime_.resize(limit/2, true); |
is_prime_.resize(limit/2, true); |
||
| Line 400: | Line 400: | ||
* @return true if the integer is prime |
* @return true if the integer is prime |
||
*/ |
*/ |
||
inline bool |
inline bool prime_sieve::is_prime(size_t n) const { |
||
if (n == 2) |
if (n == 2) |
||
return true; |
return true; |
||