Plz explain solution of question 14 of this quiz,plz because i am unable to find it

#1

plz explain it,i am not gettin how to do it

#2

Hi Rishi,
pls send the pic of the ques u are referring to

#3

Find the time complexity of the given code. void pat(){ for (int i = 2; i <=n; i = pow(i, c)) { //Print statement - O(1) operation } //Here fun is sqrt or cuberoot or any other constant root for (int i = n; i > 1; i = fun(i)) { //Print statement - O(1) operation } } O(N LogN) O(N^3) O(N^2) LogLog N

#4

https://ide.codingblocks.com/s/624593 sir this the link of code

#5

sorry link of that question

#6

Hi, it would be loglogN
since its a power function inside for loop

#7

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.