2012/12/11 Stephen Bloch <bl...@adelphi.edu>: > On Dec 11, 2012, at 6:01 AM, Jens Axel Søgaard wrote:
> Would it perhaps make more sense for small-primes to contain primes > themselves, in increasing order so one can be found by binary search, rather > than booleans? The O(1) behavior would be replaced by O(log(limit)), but > perhaps you would save enough memory to put the limit higher. Worth a try. -- Jens Axel Søgaard ____________________ Racket Users list: http://lists.racket-lang.org/users
