Question

which of the following data structures would you use to efficiently find the kth largest number in a given list of n numbers?

Answer 1

heap, pop k elements by school standards but in reality, an inserting all vals into an array and quicksorting them is much faster than any data structure. once sorted just access the kth element

Answer 2

heap, pop k elements by school standards