Re: ANNOUNCE: Beagle 0.1.2

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:

Thank goodness.

I was worried you would not maintain Jon's standards.

	Robert Love

[Date Prev][Date Next]   [Thread Prev][Thread Next]   [Thread Index] [Date Index] [Author Index]