转移排序算法

Transferred Taxis Arithmetic

主要是对传统排序算法进行改进的“转移”排序算法的基本原理进行了分析,对其程序流程进行了讨论,对转移排序算法的时间复杂度进行了测算;从而得到了其排序时间性能为O(n),比传统算法在时间性能上有所提高。

This paper mainly analyzes the basic principles of transferred taxis arithmetic, which has improved the traditional taxis arithmetic, then discusses its sort program, measures the complexity of the time about the transferred taxis arithmetic. Therefore, it proved that its timeliness of taxis is O (n), has been improved a lot, compared with the traditional one.