Hacker News
new
past
comments
ask
show
jobs
points
by
moi2388
1 days ago
|
comments
by
AlotOfReading
1 days ago
|
[-]
It would only be O(n) if the number of additions was constant. Here it varies with the size of the multiplier, giving us O(n*m).
reply