A new algorithm for order statistic and sorting

Abstract

An algorithm for rank filtering and stack filtering is presented. This algorithm is simple and results in fast and easy implementations. Various implementations of the algorithm are described, and the H-tree design is shown to be most area efficient. Also introduced is a modification of the filtering algorithm that results in better implement sorting.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>