Given an array A of n elements and a positive integer k ≤ n, find the k^th smallest element of A and partition the array such that A(1), ..., A(k-1) ≤ A(k) ≤ A(k+1), ..., A(n).