Description: Experiment: given X and Y are n-bit integers, calculate the product of the XY. The idea of divide and conquer algorithm, the n-bit X and Y is divided into two segments, each n/2. Then X is divided into AB two Y divided into CD two. X = A* (10) ^ (n/2)+B, Y, = C* (10) ^ (n/2)+D the XY = (A* (10) ^ (n/2)+B) (C* (10) ^ (n/2)+D) = AC* (10) ^ n+ (AD+BC)* (10) ^ (n/2)+BD.
To Search:
File list (Check if you may need any files):
大整数乘法\大整数乘法.txt
大整数乘法