Subj : Re: Faster algorithm for prim numbers..!!
To   : comp.programming
From : Steve O'Hara-Smith
Date : Wed Sep 21 2005 01:20 pm

On Wed, 21 Sep 2005 09:15:01 +0200
"Robert Bralic" <robo_bralic@yahoo.co.uk> wrote:

> I weated a simple program, he is compiled
> with gcc, and generates prim numbers,
> with fastes method that I find.He is based
> on divide with generated prim numbers...
> At end he gives time report on format:
> dd:hh:mi:sec...
> Precompile as gcc prim.c -o prim, and use
> him as "prim upper_bound",as example:
> "prim 1000".If anybody have some idea
> how to make algorithm fastes write to me...!!

	http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
and
	http://en.wikipedia.org/wiki/Sieve_of_Atkin

-- 
C:>WIN                                      |   Directable Mirror Arrays
The computer obeys and wins.                | A better way to focus the sun
You lose and Bill collects.                 |    licences available see
                                            |    http://www.sohara.org/

.