Sorting Real Numbers in O(n√( n)) Time and Linear Space
share
We present an O(n√( 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 Ω (n n) time to be sorted.
READ FULL TEXT