[ Jon is having some email problems, so I'm sending this out on his
behalf. -j ]
I'm pleased to announce the release of Beagle 0.1.2.
Since 0.1.1, we've been focusing on fixing bugs and reducing our memory
consumption. We still use too much memory, but the situation is definitely
improving.
On Fri, 2005-11-11 at 14:33 -0500, Joe Shaw wrote:
It is possible to find the k-th largest element of a unsorted list
of N numbers in O(N) time:
http://en.wikipedia.org/wiki/Selection_algorithm
Thank goodness.
I was worried you would not maintain Jon's standards.
Robert Love
