Hacker News Reader

O(x) = O(1) if x is some finite constant.

There is no bound on n, it always searches to INT_MAX regardless of n.

Big-O notation says nothing about the overall absolute size. All that matters is how the amount of work scales with the input value.

If an algorithm will always take 1 billion years to complete regardless of the input, then it's still O(1).

Consider n=INT_MAX*2 or INT_MAX^2 though.

The behaviour does flatline as n approaches infinity