Develop an algorithm that computes the kth smallest element of a set of n distinct integers in O$($n$+$klogn$)$time$.$ You are allowed to reference and use any algorithms or data structures discussed in Zybooks Chapters $1$ and $2$ as part of your solution.