Optimisation in prime sieve

#1

I dont understand the complexity
according to me --> nn(1/2+1/3+1/4+…+1/n)=O(n^2log(logn))

#2

aacording to ur equation
tc =n^2log(n) as the series is A HP series which sum is
s=1/d(log((2a+(2n-1)d)/2a-d);

#3

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.