I am working on a problem where I need to find the k-th largest element in an unsorted array of integers. I understand that sorting the array and then picking the k-th element is one approach, but this seems inefficient for large datasets.

1.What are the more efficient algorithms to achieve this?

My Current Approach: I tried using the following approach:def find_kth_largest(nums, k):
nums.sort()
return nums[-k]While this works, it’s not optimal for large arrays. I’ve read about using heaps or the Quickselect algorithm but I’m struggling to implement these approaches.Additional Information:The array can have duplicate elements.The array size can be very large (up to millions of elements).