How is the time complexity for sieve method O(logn)?

[namanmittal0007 (Naman Mittal)]

please help me understand the same

[asaurabh_26 (logical coder)]

hi naman

i think i you asked this doubt earlier and i have replied to you as well
please check this

How did thi O(n*log(logn)) came as the comolexity?

Understanding the n*log(log n) time complexity of Sieve of Eratosthenes If it is assumed that the time taken to mark a number as composite is constant, then the number of times the loop runs is equal to:[\frac{n}{2} + \frac{n}{3} + \frac{n}{5} + \frac{n}{7} + ...... p] On taking n common from the above equation, the above equation can be rewritten as: [n*(\frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + ...... p)] It can be proved as below with the help of Harmonic Progression …

if you have another doubt you can still ask here

[asaurabh_26 (logical coder)]

if you have doubt in any step you can ask here

[asaurabh_26 (logical coder)]

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.