What is the complexity of empty for loop?

Question

I was wondering if the complexity of a empty for loop like below is still O(n^2)

for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
    }
}

update : changed height and width variable to n

Answer 1

If it won't get optimized out by the compiler, the complexity will still be O(n^2) (or actually O(N*M)) - even though the loops bodies are empty, the condition checks and incrementation of both counters are still valid operations which have to be performed.