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
_______________________________________________
Dashboard-hackers mailing list
Dashboard-hackers@gnome.org
http://mail.gnome.org/mailman/listinfo/dashboard-hackers
