Michael T. Richter wrote:
I'm trying my hand at making an improved, more efficient, Sieve of
Eratosthenes implementation based on Melissa O'Neil's paper
(http://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf) to augment the
inefficient not-Sieve I've documented at
apfelmus wrote:
Lazy skew heaps are thoroughly explained in
C. Okasaski. Fun with binary heap trees.
In: The Fun of Programming. Palgrave. 2003.
http://www.palgrave.com/pdfs/0333992857.pdf
Extremely cool stuff, that. I love it when people write material like
this...
