such as adds, shifts, and bitwise operations (bit–ops) on uwords and swords, as summarized in Table 3.1. We show how to use these operations to divide by ar- bitrary nonzero constants, as well as by divisors w
all the fast versions of the algorithms are based on fast multiplication of big Integers using Fast Hartley Transform which runs for O(N * log N * log log N) time instead of classic O(N^2). Code Example Here is a sample of code which uses IntX to calculate 42 in power 1048576 (...
in managed code is still quite fast :) GMP also has comparable performance on huge integers multiplication since, as well as IntX, it implements fast multiplication algorithm using FFT; it's also worth noticing that division for huge integers works few times faster in GMP comparing to IntX. ...