Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Bead sort: faster than O(N log N) sort.
Those slides are an interesting read generally if you're not familiar with CSP/Alef/Limbo-style programming, despite the crufty Occam syntax.
There are no comments on this comment yet.
Those slides are an interesting read generally if you're not familiar with CSP/Alef/Limbo-style programming, despite the crufty Occam syntax.