 Related problems include partial sorting (sorting only the "k" smallest elements of a list, or alternatively computing the "k" smallest elements, but unordered) and selection (computing the "k"th smallest element).These can be solved inefficiently by a total sort, but more efficient algorithms exist, often derived by generalizing a sorting algorithm.The most notable example is quickselect, which is related to quicksort.