File APIs for Java Developers
Manipulate DOC, XLS, PPT, PDF and many others from your application.
The moose likes Java in General and the fly likes Recursive multiplication and Karatsuba Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login
JavaRanch » Java Forums » Java » Java in General
Bookmark "Recursive multiplication and Karatsuba" Watch "Recursive multiplication and Karatsuba" New topic

Recursive multiplication and Karatsuba

James Charles

Joined: Mar 14, 2011
Posts: 1
Hey everyone, I've got a question where I'm sort of stuck on writing a java code for a recursive "school method" multiplication where we have input 'n' and two n digit numbers 'a' and 'b' where the output is m=a.b. I also have to use an array representation for representing numbers. Could anyone please help me out? Thanks

The basic format is a=a1.B^(k) + a0 and b=b1.B^(k) + b0 where a.b=a1.b1.B^(2k)+(a1.b0+a0.b1).B^(k)+a0.b0 and k=floor(n/2)

Also then how would you use this and implement a Karatsuba multiplication if say n>3.
sudheer kiran
Ranch Hand

Joined: Jun 26, 2008
Posts: 237

hi james,will you please send more description

Campbell Ritchie

Joined: Oct 13, 2005
Posts: 46337
Welcome to the Ranch

What is a Karatsuba multiplication? I have never heard of it before.

I am going to have to tell you to use the high-tech hardware I so often recommend. A sheet of paper, a (soft) pencil and a (large) eraser.
Write down how you would do it on paper, and get it down to words of one syllable. Then you will know how to convert it to code. You may have to write passing half a number. Remember you will get down to where k is 0, and you will have to stop your recursion at that point.
Darryl Burke

Joined: May 03, 2008
Posts: 5115

James, please BeForthrightWhenCrossPostingToOtherSites

luck, db
There are no new questions, but there may be new answers.
I agree. Here's the link:
subject: Recursive multiplication and Karatsuba
It's not a secret anymore!