Sorting of data elements is a technical problem arising in many fields including statistics. Sorting is the process of rearranging disordered data elements according to the values.
The most important problem in sorting is to decrease the complexity of sorting. Previous papers described several methods to improve selective sorting, one of which is to select and store small data elements during a single scan to shorten the sorting time using a queue.
In order to further update the time of selective sorting, Jong Yong Bok, a researcher at the Faculty of Information Science and technology, has proposed a method of shortening the run time for sorting by half over the existing methods by selecting and storing both the minimum and maximum elements at the same time during one pass using a queue and a stack.
The proposed method proves to be effective for sorting data elements in the fields where they appear iteratively with fortuity including statistics of population according to age and grade management.