bsort: A theoretically efficient non-comparison-based sorting algorithm for integer and floating-point numbers

TL;DR

The paper introduces bsort, a non-comparison-based sorting algorithm for integers and floating-point numbers, achieving efficient runtime and space complexity, and demonstrating competitive performance with existing optimized algorithms.

Contribution

It presents a unified, theoretically efficient sorting algorithm for multiple data types based on binary quicksort principles.

Findings

Achieves $O(wn)$ runtime and $O(w)$ space complexity.

Performs competitively with optimized hybrid sorting algorithms.

Effective for data types with small word sizes.

Abstract

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.