LINEAR-TIME TOP-K SORT METHOD

摘要

PURPOSE: A linear-time top-k sort method is provided to calculate a data with the maximum key value in a linear time which is proportioned the size of data group. CONSTITUTION: A data is read from a data set, and a read data element is eliminated from the data set(S1). An initial minimum heap structure initiates a top-K heap and constituted by inputting the data to the top-k heap(S2). An arbitrary element is extracted from the data group(S3). If the key value of the element is larger than the key value of a root node, the root node is replaced with the element(S5).