Counting divisors using sieve

#1

I tried implementing the code as explained in the video tutorial. Yet, I’m getting incorrect answers. Please help me resolve the bug.

#2

hello @punerva_singh

check now->

#3

Thanks, It’s working now

#4

What is the space and time complexity of this approach?

#5

time complexity->
O( n log ( log n ) + sqrt(n) ) // sieve prepration + factorisation
space complexity ->
O(n) becuase of sieve size

#6

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.