[erlang-questions] Prime numbers exercise from Project Euler

Anthony Ramine <>
Wed Jul 24 20:50:46 CEST 2013


Hello Peer,

I was bored so I implemented it with a mutable HiPE bitarray.

	https://gist.github.com/nox/6073337

Regards,

-- 
Anthony Ramine

Le 24 juil. 2013 à 17:56, Peer Stritzinger a écrit :

> If you really looking for a fast sieve try http://en.wikipedia.org/wiki/Sieve_of_Atkin




More information about the erlang-questions mailing list