- Print and remove the root
k
times; O(k log n)
;- Yes.
top-k largest element from the max heap [closed]
-
29-06-2022 - |
Domanda
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?
Soluzione
Autorizzato sotto: CC-BY-SA insieme a attribuzione
Non affiliato a StackOverflow