Implementing the Diverting Fast Radix Algorithm

TL;DR

This paper introduces ThielSort, a practical implementation of the Diverting Fast Radix algorithm, demonstrating its competitiveness through theoretical improvements and empirical testing on various data distributions.

Contribution

It provides the first practical implementation of the DFR algorithm, highlighting its efficiency and competitiveness with existing sorting algorithms.

Findings

ThielSort performs well across different data distributions.

The DFR algorithm shows theoretical and practical advantages over classical radix sorts.

Implementation details enable reproducibility and further optimization.

Abstract

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.