Select the k^th smallest element of an array and partition the array around it. Partition around the value of the k^th element. If the partition boundary is not at k, repeat in the partition that includes k.