What is the quick formula(s) way for evaluating no. of times a loop will be processed without actually evaluating the loop? I suggest you to read some books which contain the algorithm analysis.
From your example, I know that it is required 0(n) which n representing the times of the for loop.
Hope this help