big o - Can an algorithm have a runtime of O(2n)? -

this question has answer here:

• which algorithm faster o(n) or o(2n)? 4 answers

if algorithm iterates on list of numbers 2 times before returning answer runtime o(2n) or o(n)? runtime of algorithm lack coefficient?

it may still slower implementation doesn't iterate twice, still o(n), time complexity scales based on size of n.