Recursive mulitiplication of two numbers
We have two numbers (binary) which lenght is n=2^k, k is from N.
We need to multiplicate this two numbers with method divide and conquer.
x =1011 * 2^4 +0110.
How to do that in c++?
|All times are GMT +5.5. The time now is 07:00.|