This repo contains a PoC of Binary Integers which is a representation of aribitrarily large integers by their odd and even part, e.g. represent an integer n by (x,y) where n = 2x y and where y is odd. This speeds up shifts a bit, which gives a speed up to some algorithms. Here we give an example of how it speeds up Stein's algorithm, aka Binary GCD.
jonas-lj / binary-integers Goto Github PK
View Code? Open in Web Editor NEWRepresenting integers by their odd and even part to speed up Stein's algorithm