Is the efficiency of this algorithm O(n*log(n))?

Question

Algorithms

I am writing one code, I need to find out the time efficiency. I'm guessing O(n*log(n)), but I'm not sure.
Here is the code:

int end = 10;

void task1()
            {
                for (int i = 0; i < (int)(end/ 2); i++)
                {
                    // код 1
                }
            }

void mainTask()
            {
               task1();
               while(end != 0)
               {
                  task1();
                  end--;
               }
            }
mainTask();

As you understand, this is an example code of my program.
PS I forgot to add. end - the length of the array.

Answer 1

No, it's O(n^2). Where did you get the log from?

Answer 2

It looks like O(1) if O(1) happens inside the loop, because there is no changeable parameter from which the
UPD time would change
if end is a variable, then it will be O(N^2)