# Question based on Algorithmic Complexity?

Can a question on this site have a winner based on the lowest complexity? Each answer would require the code's complexity in Big-O notation, and the winner would be the first to submit an answer with the lowest (so, if three people submit answers with O(n), the first one wins).

I can't remember seeing any questions like this, so I am curious as to what the decision will be.