what is the time complexity of the function using Big-O notation here. I would just like this explained to me in a detailed format. To determine the time complexity what must I calculate within this function.

void doo (int intArray[0,........,n-1])

     for(int i=0; i<n; i++)
       {
               if(intArray[i]==0)
                   {
                         intArray[i]=1;
                    }

             print (intArray[i]);
             for(k=2; k<=10;k++)
              {
                     intArray[i]=j*intArray[i];
              }

                   Print(intArray[i]);
                 }
}

Time Complexity?

This isn't a C# question, and you should be figuring this out yourself using lecture notes and other examples seen in class, in textbooks, and on this and other websites.