def find_kth(self, A, i, j, k):
        """
        partial quick sort
        """
        p = self.partition(A, i, j)
        if p == k:
            return A[p]
        if p > k:
            return self.find_kth(A, i, p - 1, k)
        else:
            return self.find_kth(A, p + 1, j, k)
dataset/ETHPy150Open algorhythms/HackerRankAlgorithms/Find the Median.py/Solution.find_kth/original