Re: ANNOUNCE: Beagle 0.1.2

From: Robert Love <rml novell com>
To: Joe Shaw <joeshaw novell com>
Cc: gnome-announce gnome org, dashboard-hackers gnome org
Subject: Re: ANNOUNCE: Beagle 0.1.2
Date: Fri, 11 Nov 2005 17:03:02 -0500

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

References:
- ANNOUNCE: Beagle 0.1.2
  - From: Joe Shaw

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