Question 3 is incomplete

#1

Consider the following function

find (int n)
{
if (n < 2 ) then return;
else
{
sum= 0;
for (i= 1; i ≤ 4; i++) find (n2);
for (i=1; i≤ n*n; i++) sum= sum + 1;
}
}
Assume that the division operation takes constant time and “sum” is global variable. What is the time complexity of “find (n)” ?

n2 is undefined here( 7th line of code), kindly clarify.

#2

@7nishit I think it is meant to be n/2 in line 7

#3

Kindly correct it, it is ambiguous.

#4

@7nishit please mark your doubt as resolved if you are satisfied

#5

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.