public static int findKth(int[] a, int n, int K) { // write code here QuickSort(a, 0, n - 1, K); return res; } private static void QuickSort(int[] a, int l, int r, int k) { if (l < r) { int i = l, j = r; while (i < j) { int temp = a[l]; while (i < j && a[i] < temp) i++; while (i ...