What is the time complexity of this

Question

find(int n)

{

  if(x<2)return;

  else

  for(i =1; i<=4; i++)

      find (n/2);

  for(i= 1;i< =n*n; i++)

      sum=sum+1;

}

 

Answer 1

Recurrence Relation of above program =4T(n/2)+n²

Now solve using master theorem =O(n²logn)

Comments

how can one imagine to form recurrence

---

By practice