Kth Largest Element in an array

Given an integer array nums and an integer k, return the kth largest element in the array. Note that it is the kth largest element in the sorted order, not the kth distinct element. Can you solve it without sorting?

Example 1:
Input: nums = [3,2,1,5,6,4], k = 2
Output: 5

Example 2:
Input: nums = [3,2,3,1,2,4,5,5,6], k = 4
Output: 4

Constraints:

1 <= k <= nums.length <= 105
-104 <= nums[i] <= 104

Algorithm: §

• Sort Array
• array[k - 1]

function kthLarge(arr, k){
	arr.sort((a,b)=>{return b-a})
    console.log("🚀 ~ file: Array Prototype Last.js:3 ~ kthLarge ~ arr:", arr)
    
	return arr[k - 1]
}

nums = [3,2,1,5,6,4]
kthLarge(nums , 2)
console.log("🚀 ~ file: Array Prototype Last.js:48 ~ kthLarge(nums , 4):", kthLarge(nums , 2))

Now how to make this without actually sorting ?

QuickSelect ! §