Quickselect algorithm to select kth smallest element

I think it would be valuable for the users (at least for me) to have a quickselect algorithm (or any alternative algorithm) to find the kth smallest element in a given array (and a segmented version). We can currently achieve this by using sort and segmented sort but the sorting cost is likely higher than determining the kth smallest element using a more specific algorithm for the task.