Article
25 Sep 2012
license: CPOL
This article show how we optimize a Primality Test for know if a number is prime or not, and also presents an algorithms (Sieve of Eratosthenes) for calculating the prime numbers for a numbers less than or equal a given numbers efficiently.
General Programming » Algorithms & Recipes » Algorithms