Given an array arr and a number K where K is smaller than size of array, the task is to find the K’th smallest element in the given array. It is given that all array elements are distinct.
Expected Time Complexity: O(n)
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 desired output in a new line.
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.