Function to assess whether or not an integer is prime.

This function uses the Sieve of Eratosthenes to find all the primes less than or equal to a given integer.

1 | ```
primesieve(sieved, unsieved)
``` |

`sieved` |
Identified primes (empty vector for initialization) |

`unsieved` |
Candidate integers |

The function assumes that `unsieved` is a vector of positive integers.

Returns a vector of primes sieved (selected) from the input vector.

Jones, O.D., R. Maillardet, and A.P. Robinson. 2009. An Introduction to Scientific Programming and Simulation, Using R. Chapman And Hall/CRC.

1 | ```
primesieve(c(), 2:200)
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.