SELF DOUBT TIME OMPLEXITY

Question

https://gateoverflow.in/154097/find-the-value-of-p 

AND THE TIME COMPLEXITY WILL BE O(nlogn)??

Answer 1

Time complexity will be O(n log₅n ) because.

1. The inner loop is independent of the outer loop. For each value of  i  It will run log₅n each time.

so, for n times it will be = O(n log₅n ).

for(i=1;i<=n;i++) =================================== O(n)
    {
        for(j=1;j<=n;j=5*j) { ==============log

₅n {p = p + n; } }

Because inner loop doesn't depend on the on the outer loop so, directly multiply here O(n log₅n ).