Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.08929 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912957713088512 |
|---|---|
| author | Guzmán, Benjamín |
| author_facet | Guzmán, Benjamín |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_08929 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | bsort: A theoretically efficient non-comparison-based sorting algorithm for integer and floating-point numbers Guzmán, Benjamín Data Structures and Algorithms Hardware Architecture Performance 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. |
| title | bsort: A theoretically efficient non-comparison-based sorting algorithm for integer and floating-point numbers |
| topic | Data Structures and Algorithms Hardware Architecture Performance |
| url | https://arxiv.org/abs/2603.08929 |