access kth element in constant time. This is a divide and conquer algorithm that can find a solution in O(n) time. # pick a pivot and separate into list based on pivot.

Abstract: Order statistic filters form a subclass of the stack filters. The design of stack filters is computationally prohibitive for relatively large windows. A possible approach to overcome this ...