@all....Why Not Try Carziest Thing in This Question.... Q.1st Prrove Timpe Complexity of Sieve of Eratosthenes is O(Log(Log(n))) ..isn't Making U Stuck..??
Q.2nd We Need to Drease the same Number of element sieved more then one time e.g 6,12 & all the multiples of 2,3 ..then again all the multiples of 2,4,6,...many are sieving so many times..as the number of multiples increases ..isn;t it important modification in Sieve of Eratosthenes Prime Algo.. Thanks Shashank -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
