Is the time complexity of the empty algorithm O(0)?

Question

So given the following program:

---

Is the time complexity of this program O(0)? In other words, is 0 O(0)?

I thought answering this in a separate question

Answer 1

It should be O(1). The coefficient is always 1.

Consider:

If something grows like 5n, you don't say O(5n), you say O(n) [in other words, O(1n)]

If something grows like 7n^2, you don't say O(7n^2), you say O(n^2) [in other words, O(1n^2)]

Likewise you should say O(1), not O(some other constant)