Quote:
Originally Posted by axn
I am just wondering. What do you think 'n' means in this context? I get the feeling that you consider 'n' to be the number being multiplied rather than the number of bits/digits in the number being multiplied.

The input to a complexity function is the SIZE of the problem........
We measure time/space complexity as a function of the size of the inputs.....
The size of a number is its length (in whatever radix you choose)
(as axn knows)