相对排序算法

Arithmetic of Relative Ordering

排序是计算机算法设计中的重要运算,本文提出一种以相对大数右移,对应的相对小数左移的算法实现数据的排序,并给出了算法描述、实现及正确性证明。其时间复杂度为O(n2)。

Ordering is an important operation in computer arithmetic designs. This paper argues that the realization of data ordering can be accomplished by moving the relatively large number to the fight and the corresponding comparative small number to the left. The description of arithmetic and proof of accuracy are given as well in this paper. Its timing complexity is O（n^2）.