Talk:TADM2E 2.38
From Algorithm Wiki
Correction proposal:
I believe the correct solution should be 0(n^2), as it mentions O(1) for 1-digit to 1-digit operations, so mulrilying the first number for each digit of the second, also requires n multiplications (1 for each digit of the forst number)
