 If sorting is allowed, previously known order statistics finding algorithms may be exploited.For example, for "k"=2, a median may be found first in linear time, and then it may be easily tested whether there are more than "n"/2 median elements.However the above algorithms require fewer comparisons than the order statistics algorithms.