An Efficient Partial Sort Algorithm for Real Time Applications

Abstract

An efficient partial sort algorithm that is less complex, and more practical to implement compared to existing partial sort algorithms especially for real time applications is presented. The proposed partial sort algorithm does not use pivots, but instead makes use of past sorting decisions to narrow the search for each new sorted element. A major advantage of the proposed partial sort algorithm is that its complexity and sorting time are fixed, and are not dependent upon the data to be sorted, unlike other algorithms. This makes it a good candidate for real time applications.