Re: [algogeeks] What is the time complexity of multiplying two n-digit numbers base b

2010-07-31 Thread Shiv ...
O(log n). If u add in pairs. e.g. (5+5)=10. now add 10+10. On Sat, Jul 31, 2010 at 6:28 PM, sourav wrote: > When you first learned to multiply numbers, you were told that x * y > means adding x a total of y times, so 5 * 4 = 5+5+5+5 = 20. What is > the time complexity of multiplying two n-digi

[algogeeks] What is the time complexity of multiplying two n-digit numbers base b

2010-07-31 Thread sourav
When you first learned to multiply numbers, you were told that x * y means adding x a total of y times, so 5 * 4 = 5+5+5+5 = 20. What is the time complexity of multiplying two n-digit numbers in base b using the repeated addition method, as a function of n and b. Assume that single-digit by single-