On: Big O Notation: Using not-boring math to measure code's efficiency

[shloub]

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 :(

[gameguy43 → shloub]

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

[jackpirate → gameguy43]

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

[gameguy43 → jackpirate]

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

[shloub → gameguy43]

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