Improved fast integer sorting in linear space

@inproceedings{Han2001ImprovedFI,
  title={Improved fast integer sorting in linear space},
  author={Yijie Han},
  booktitle={SODA},
  year={2001}
}
We present improved fast deterministic algorithm for integer sorting in linear space. Our algorithm sorts <i>n</i> integers in linear space in <i>&Ogr;</i>(<i>n</i> log log <i>n</i> log log log <i>n</i>) time. This improves the <i>&Ogr;</i>(<i>n</i>(log log <i>n</i>)<sup>3/2</sup>) time bound given in [6]. When the <i>n</i> integers in {0,1,…, <i>m</i> - 1} to be sorted satisfying log <i>m</i> ⪈(log <i>n</i>)<sup>2</sup>+∈, 0 < ∈ < 1, the time complexity for sorting can be further reduced to <i… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Similar Papers

Loading similar papers…