find the K-th largest element in an unsorted array

2022年5月1日

小于 1 分钟

Question

You are given an unsorted array of numbers, which might have duplicates, find the K-th largest element.

The naive approach would be sort it first, but it costs O(nlogn), could you find a better approach?

/**
 * @param {number[]} arr
 * @param {number} k
 */
function findKThLargest(arr, k) {
  // your code here
}