论文标题
实施转移快速radix算法
Implementing the Diverting Fast Radix Algorithm
论文作者
论文摘要
本文介绍了Thielsort，这是转移快速radix（DFR）算法的实际实现。概述了对经典radix类别的理论改进，并指定实施细节，以证明该算法与最新的状态具有竞争力。通过考虑各种数据和输入大小的标准分布，显示了DFR算法实现的有效性。
This paper presents ThielSort, a practical implementation of the Diverting Fast Radix (DFR) Algorithm. The theoretical improvements over classical radix sorts are outlined and implementation details are specified to demonstrate that the algorithm is competitive with the state of the art. The effectiveness of this implementation of the DFR algorithm is shown by considering a variety of standard distributions of data and input sizes.
