Recursive mulitiplication of two numbers

Discussion in 'C' started by Croatoan, Nov 12, 2010.

  1. Croatoan

    Croatoan New Member

    Nov 12, 2010
    Likes Received:
    Trophy Points:
    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++?

Share This Page

  1. This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
    By continuing to use this site, you are consenting to our use of cookies.
    Dismiss Notice