Rearranges the elements in a so that a[k] is the kth smallest element, and a[0] through a[k-1] are less than or equal to a[k], and a[k+1] through a[n-1] are greater than or equal to a[k].
(Comparable[] a, int k)
Source from the content-addressed store, hash-verified