top-k largest element from the max heap

Question

I am a mechanical student and I have changed my field to Computers. Need to get through the algorithms class. This question is one of the exercise questions

If the max heap algorithm's running time is O(klogn) then is there any algorithm which has better running time than this?

like i said the running time is O(klogn) but is there any algorithm which has a better running time? — user2798432, Sep 20 '13 at 09:07

score 2 · Accepted Answer · edited May 23 '17 at 12:05

2

Print and remove the root k times;
O(k log n);
Yes.

edited May 23 '17 at 12:05

Community

1
1

answered Sep 20 '13 at 09:08

IVlad

43,099
13
111
179

can u please tell me which algorithm will be better and what is the running time for that? – user2798432 Sep 20 '13 at 09:14
@user2798432 - `O(k log k)` will be better, it's described in my link. – IVlad Sep 20 '13 at 09:15

top-k largest element from the max heap

1 Answers1