for(int i=0;i<n;i++)
{
// Some code
}
We generally say that this loop runs for n+1 times so n+1 steps for this and there is one step is of initialisation i=0. This I have read in most of the text books. My question is this that everytime the loop runs there is one more step of incrementing i to i+1 that is i=i+1, this is also one of the step which should be counted in calculating the time complexity.As I am a newbie to algorithm analysis help me with this problem.