Be the first user to complete this post

Add to List 
Find the Kth Smallest/Largest Element in an Array
Objective: Given an array of integers. find the K^{th} Smallest/largest element in the array.
Example
int[] A = { 1, 2, 10, 20, 40, 32, 44, 51, 6 }; K=4^{th }smallest element in given array: 10
Approach: (K^{th} Smallest Element)
 Use minHeap. (Click here to read about Priority Queue).
 Insert all the elements in the Priority Queue.
 Extract K elements from the priority queue. The last element (k^{th}) extracted with be the k^{th} smallest element in the array.
Code:
Output:
Output: 4th smallest element:10
Note: For k^{th} largest element, implement priority queue for maxHeap.
Also Read: