What is Big O of a loop?

Question

I was reading about Big O notation. It stated,

The big O of a loop is the number of iterations of the loop into number of statement

Answer 1

Big-O notation ignores constant multipliers by design (and by definition), so being O(n) and being O(2n) is exactly the same thing. We usually write O(n) because that is shorter and more familiar, but O(2n) means the same.