Given an array arr and a number K where K is smaller than size of array, the task is to find the Kth smallest element in the given array. It is given that all array elements are distinct.
The first line of input contains an integer T, denoting the number of testcases. Then T test cases follow. Each test case consists of three lines. First line of each testcase contains an integer N denoting size of the array. Second line contains N space separated integer denoting elements of the array. Third line of the test case contains an integer K.
Corresponding to each test case, print the kth smallest element in a new line.
Expected Time Complexity: O(N).
Expected Auxiliary Space: O(1).
1 <= T <= 100
1 <= N <= 105
1 <= arr[i] <= 105
1 <= K <= N
7 10 4 3 20 15
7 10 4 20 15
Testcase 1: 3rd smallest element in the given array is 7.
Testcase 2: 4th smallest elemets in the given array is 15.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.