Is the initialization part included when calculating the loop-type time?

I'm a soldier who takes a data rescue class by himself.

Honestly, I wonder why I'm asking this question myself, I'm asking you a question to get an answer.

Suppose the for statement is as follows.

for( i = 1; i < n ; i ++ ) {
    i = i + 1;
}

In this case, I thought:

Obviously, Big O is O(n) here, but

Here, it is confusing whether the number of times is 3 or 2.

Let's see

I'm curious.

I'm sure you'll all say this

The main is time complexity, not repetition. In the end, it is only a process of calculating the efficiency of the function by obtaining the big oh.

Yeah. He's just curious about this. If you don't understand why this is happening, you can't fall for it