  We present an $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 $\Omega (n\log n)$ time to be sorted.
