Conversely, given a selection algorithm, one can easily get an unordered partial sort ("k" smallest elements, not in order) in O("n") time by iterating through the list and recording all elements less than the "k"th element. If this results in fewer than "k" − 1 elements, any remaining elements equal the "k"th element. Care must be taken, due to the possibility of equality of elements: one must not include all elements less than "or equal to" the "k"th element, as elements greater than the "k"th element may also be equal to it.