This paper presents bsort, a non-comparison-based sorting algorithm for signed and unsigned integers, and floating-point values. The algorithm unifies these cases through an approach derived from binary quicksort, achieving $O(wn)$ runtime asymptotic behavior and $O(w)$ auxiliary space, where $w$ is the element word size. This algorithm is highly efficient for data types with small word sizes, where empirical analysis exhibits performance competitive with highly optimized hybrid algorithms from popular libraries.

翻译：本文提出bsort算法，一种适用于有符号/无符号整数及浮点数值的非比较型排序算法。该算法通过基于二进制快速排序的方法统一处理上述数据类型，实现$O(wn)$的时间复杂度与$O(w)$的辅助空间复杂度，其中$w$表示元素字长。对于字长较小的数据类型，本算法具有显著效率优势，实证分析表明其性能可与主流库中高度优化的混合排序算法相媲美。