3 ms·

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 12y ago
  Hm, sounds like a bug. Which example are you referring to?
  • jackpirate 12y ago
    The size of an integer n is O(log n).
    • gameguy43 12y ago
      Ah, gotcha. I'll patch that up. Thanks!
      • shloub 12y ago
        I was referring to the print s*n example (O(n) being exponential wrt the size of the input). You're welcome ;)