Description: large integer multiplication example code/* Recursive border, if it is a binary number with a binary number multiplication, can be directly calculated*//* the beginning of a binary multiplication of the number*//* return (X* Y)*//* calculate the value of n*//* X and Y to split it so that X = A* 2 ^ (n/2) B, the left shift operator, mod = 1LT; lt; (n/2)*//* calculate XY = AC* 2 ^ n (AD CB)* 2 ^ (n/2) BD*//* A* C calculation, further n-bits*//* recursive computation A* D*//* recursive calculation of C* B*//* Calculation A21 A22 and then bits n/2*//* recursive calculation B* D*//* XY = a1 a2 a3* /
- [Matrix_ana] - written with Java for matrix calculation
- [TELECRD-hex] - France and other countries phone IC card
- [VC++jiasheng] - VC join the voice of the procedure, a si
- [BigNumberCounter] - large integer calculators, data structur
- [ByteCal] - Byte operations for small procedures, su
- [(3)] - About bit operation and the classic exam
- [dashuxiangcheng] - Using the method of big integer partitio
- [EMC78] - Elan SCM: binary code is converted to AS
File list (Check if you may need any files):
Download