[julia-users] Re: Sieve of Atkin performance.

Best out of 10 runs with a limit of 100,000,000. - Base.primes: 3.514 seconds (9042 k allocations: 194 MB, 0.22% gc time) - atkin: 2.036 seconds (20 allocations: 78768 KB, 0.03% gc time) - eratosthenes: 7.272 seconds (10 k allocations: 1677 MB, 1.58% gc time) El domingo, 28

[julia-users] Re: Sieve of Atkin performance.

Yes certainly Stefan, I'll update the gist with a MIT licence note. El domingo, 28 de junio de 2015, 10:16:16 (UTC-5), Ismael VC escribió: > > Hello everyone! > > I’ve implemented this Sieve of Atkin: > >- https://gist.github.com/Ismael-VC/179790a53c549609b3ce > > function atkin(limit::Int =

[julia-users] Re: Sieve of Atkin performance.

Stefan It's done, I've updated it with a MIT licence header: https://gist.github.com/Ismael-VC/179790a53c549609b3ce El domingo, 28 de junio de 2015, 10:16:16 (UTC-5), Ismael VC escribió: > > Hello everyone! > > I’ve implemented this Sieve of Atkin: > >- https://gist.github.com/Ismael-VC/179

[julia-users] Re: Sieve of Atkin performance.

Is that header ok? What do you think about this? The wikipedia article claims that there is room for more improvement: This pseudocode is written for clarity; although some redundant computations have been eliminated by controlling the odd/even x/y combinations, it still wastes almost half of

[julia-users] Re: Sieve of Atkin performance.

I used the wikipedia spanish version and algorithm, I didn't notice that it's a different one in the english version: * https://es.wikipedia.org/wiki/Criba_de_Atkin#Pseudoc.C3.B3digo I'll check that one too. El domingo, 28 de junio de 2015, 10:16:16 (UTC-5), Ismael VC escribió: > > Hello everyo

Re: [julia-users] Re: Sieve of Atkin performance.

Are you willing to release this code under the MIT license ? On Sun, Jun 28, 2015 at 11:19 AM, Ismael VC wrote: > Best out of 10 runs with a limit of 100,000,000. > >- Base.primes: > > 3.514 seconds (9042 k allocations: 194 MB, 0.22% gc time) > >- atkin: > >