An efficient sieve of Eratosthenes using CSP channels in Go
Go
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
.gitignore
LICENSE
README
TIMING
sieve1.go
sieve2.go
sieve3.go

README

----
Prime numbers sieve implementations using CSP channels in Go.
----

./sieve1.go    Taken from the Go language tutorial, worse than trial division

./sieve2.go    Eratosthenesque, simple implementation

./sieve3.go    Eratosthenesque, with wheel optimization and more efficient
		   implementations of `PeekChHeap` and `sendproxy`, the result is
		   about 4x faster than ./sieve2.go

I wrote about it here: http://blog.onideas.ws/eratosthenes.go