On Mon, Apr 25, 2011 at 2:45 PM, Ted Dunning <[email protected]> wrote:
> The simplest implementation is O(n log(k)) (inserts every element, then > drops at most one element). > > Caching the k-th best element and only inserting new items has the same > worst case behavior in ordered cases. > why on earth would the current situation at hand ever have a fully ordered vector? This is a search problem, and the simple search solution works almost completely linearly. -jake
