English

Sorting Real Numbers in $O(n\sqrt{\log n})$ Time and Linear Space

Data Structures and Algorithms 2018-12-04 v4

Abstract

We present an O(nlogn)O(n\sqrt{\log n}) time and linear space algorithm for sorting real numbers. This breaks the long time illusion that real numbers have to be sorted by comparison sorting and take Ω(nlogn)\Omega (n\log n) time to be sorted.

Keywords

Cite

@article{arxiv.1801.00776,
  title  = {Sorting Real Numbers in $O(n\sqrt{\log n})$ Time and Linear Space},
  author = {Yijie Han},
  journal= {arXiv preprint arXiv:1801.00776},
  year   = {2018}
}

Comments

Fixed some issues in the early versions

R2 v1 2026-06-22T23:34:46.722Z