using c++ . Consider an unsorted array with N number of elements and given number k value in range from 1 to N; we have to find the kth largest element in the best possible way which take time complexity O(n) Example: Input: K = 3 A[] = {14, 5, 6, 12, 14, 8, 10, 6, 25} Output: Kth largest element = 12 Input: K = 5 A[] = {18, 15, 3, 1, 2, 6, 2, 18, 16} Output: Kth largest element = 3

using c++ .
Consider an unsorted array with N number of elements and given number k value in range from
1 to N; we have to find the kth largest element in the best possible way which take time
complexity O(n)
Example:
Input:
K = 3
A[] = {14, 5, 6, 12, 14, 8, 10, 6, 25}
Output: Kth largest element = 12
Input:
K = 5
A[] = {18, 15, 3, 1, 2, 6, 2, 18, 16}
Output: Kth largest element = 3