PlumX Metrics
Embed PlumX Metrics

Radix sorting with no extra space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 1611-3349, Vol: 4698 LNCS, Page: 194-205
2007
  • 36
    Citations
  • 0
    Usage
  • 16
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    36
    • Citation Indexes
      36
  • Captures
    16

Conference Paper Description

It is well known that n integers in the range [1, n] can be sorted in O(n) time in the RAM model using radix sorting. More generally, integers in any range [1, U] can be sorted in O(n√log log n) time [5]. However, these algorithms use O(n) words of extra memory. Is this necessary? We present a simple, stable, integer sorting algorithm for words of size O(log n), which works in O(n) time and uses only O(1) words of extra memory on a RAM model. This is the integer sorting case most useful in practice. We extend this result with same bounds to the case when the keys are read-only, which is of theoretical interest. Another interesting question is the case of arbitrary c. Here we present a black-box transformation from any RAM sorting algorithm to a sorting algorithm which uses only O(1) extra space and has the same running time. This settles the complexity of in-place sorting in terms of the complexity of sorting. © Springer-Verlag Berlin Heidelberg 2007.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know