Simplest arbitrary precision algorithms

[NewsBot]

I'm aware of a number of algorithms for working with arbitrary-precision (i.e. bignum) numbers, like Schonhage-Strassen, Karatsuba, and Toom-Cook, (and a few others), but for a simple bignum implementation to solve a problem (I can't use IntX) which set of algorithms is the simplest?

 

I only operations I'll need to perform are the major arithmetic operations (addition, subtraction, multiplication, division, and possibly exponentiation with natural powers, but that's just multiplication on steroids), oh, and Modulo (as in, remainder-of-division).

 

I'm after the algos which are the simplest to implement in a C-style language (pointers are okay), I'm not after the tightest BigO performance figures, this is just to prove something.

 

And I need to have it done within a week too :)

 

 

More...

 

View All Our Microsoft Related Feeds