write a theta $($n$)$ algorithm that sorts n distinct integers ranging in size between $1$ and kn inclusive, where k is a contant positive integer