Time complexity

Question

Is this the correct way to solve ?

Q) int algorithm(int n)
{
   int sum =0;k,j;
   for (k=0;k<n/2;k++)
      for(j=0;j<10;j++)
          sum++;
  return 4*algorithm(n/2)*algorithm(n/2)+algorithm(n/2)*algorithm(n/2)
}

Comments

@Shaik Masthan now my doubt is clear, thanks a lot

---

@Shaik Masthan,Bhai but in above example the code has been used 3 times. However,since 4*T(n/2) has been mentioned therefore,the code used 4 times. Am I right?

---

noo brother, read one more time the previous comments !

is it 3 times or 4 times used check ome more time ?