Hacker News Reader

Or, phrased differently, if n has an upper limit, the algorithm is O(1).

As long as you have tests that regularly exercise your algorithm at n=max where you would notice if they were exceptionally slow