well the complexity is not O(n)
On Sun, Nov 29, 2009 at 7:20 PM, harit agarwal agarwalha...@gmail.comwrote:
read this
http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
I heard that there's a sieve algorithm whose complexity is O(n).
Can any give me the pseudo code for that ?
Thank u !
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To
read this
http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
