Can sb give me a tip for recursive multiplication of two binary numbers (their lenght is 2^n)! I need only recursive to implement it in c++ code,
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...
Separate names with a comma.
