Hacker News Reader

Says it studies the complexity wrt the size of the input but doesn't say the size of n is O(log n) when it comes to the example :(

Hm, sounds like a bug. Which example are you referring to?

The size of an integer n is O(log n).

Ah, gotcha. I'll patch that up. Thanks!

I was referring to the print s*n example (O(n) being exponential wrt the size of the input). You're welcome ;)