@Coolfrog: I don't know the complexity, but, given a very high-level description of the algorithm, it takes less than a minute to implement the algorithm and produce the answer, which probably is faster than you can implement any other algorithm and find the answer. :-)
Dave On Sep 23, 10:47 am, "coolfrog$" <dixit.coolfrog.div...@gmail.com> wrote: > @Dave > what is the complexity of this algorithm... it given *O*(*n*(log*n*)(loglog > *n*)) > but i think it should be O(n^2) > > > > On Thu, Sep 23, 2010 at 10:39 AM, Dave <dave_and_da...@juno.com> wrote: > > Following up to my own posting... Sorry. I answered the wrong > > question, "What is the sum of the first 10,000 primes?" > > > For the given problem, first you have to look in > >http://www.research.att.com/~njas/sequences/b000040.txt<http://www.research.att.com/%7Enjas/sequences/b000040.txt>to > > find the > > number of primes up to 10,000, and then look in > >http://www.research.att.com/~njas/sequences/b007504.txt<http://www.research.att.com/%7Enjas/sequences/b007504.txt>to > > find the > > sum of that number of primes. > > > Dave > > > On Sep 23, 10:32 am, Dave <dave_and_da...@juno.com> wrote: > > > @Debajyoti: Look at the "10000" line ofhttp:// > >www.research.att.com/~njas/sequences/b007504.txt<http://www.research.att.com/%7Enjas/sequences/b007504.txt> > > . > > > > Dave > > > > On Sep 23, 7:15 am, Debajyoti Sarma <sarma.debajy...@gmail.com> wrote: > > > > > How to find the sum of prime numbers between 1 and 10000. > > > > I don't expected traversal of the whole range and find primes and sum > > > > uping > > > > Any other logic is there?? i think we need deep mathematics for this .- > > Hide quoted text - > > > > - Show quoted text - > > > -- > > 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 > > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > > . > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en.- Hide quoted text - > > - Show quoted text - -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
