Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
Given [3,2,1,5,6,4] and k = 2, return 5.
You may assume k is always valid, 1 ≤ k ≤ array’s length.
There are five different solutions in this including partition, recursion, max heap, selection sort and just sorting.
Always welcom new ideas and practical tricks, just leave them in the comments!