top-k largest element from the max heap [closed]

Question

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.

---

Questions asking for code must demonstrate a minimal understanding of the problem being solved. Include attempted solutions, why they didn't work, and the expected results. See also: Stack Overflow question checklist

Closed 8 years ago.

Improve this 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

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

Answer 1

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