G'day all. Quoting apfelmus <apfelmus at quantentunnel.de>: > You mean O(k * log n + n) of course. Erm, yes. You can do it in an imperative language by building a heap in O(n) time followed by removing k elements, in O(k log n) time. Cheers, Andrew Bromage