--- Comment #2 from 2011-10-07 16:21:35 PDT ---
(In reply to comment #1)
> The canonical solution uses a heap. Creating a heap is cheap and quickly
> amortized over only a few pops. An input range that creates a heap and then
> yields one element at a time would be a better idea.

If benchmarks show that a range that heapifies the input array is about as
efficient as a tailored lazy sorting solution for about 4 to 10 requested
max/min items, then I am OK with this idea :-)

Configure issuemail:
------- You are receiving this mail because: -------

Reply via email to