Arithmetic of Relative Ordering
Jie ming Yang · Journal of Aba Teachers College · 2005
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 right 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 0(n2).