Optimal Time-Space Trade-Offs for Sorting

Forfattere

  • Jakob Pagter
  • Theis Rauhe

DOI:

https://doi.org/10.7146/brics.v5i10.19282

Resumé

We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem.
Beame has shown a lower bound of  Omega(n^2) for this product leaving a gap of a logarithmic factor up to the previously best known upper bound of O(n^2 log n) due to Frederickson. Since then, no progress has been made towards tightening this gap.
The main contribution of this paper is a comparison based sorting algorithm which closes this gap by meeting the lower bound of Beame. The time-space product O(n^2) upper bound holds for the full range of space bounds between log n and n/log n. Hence in this range our algorithm is optimal for comparison based models as well as for the very powerful general models considered by Beame.

Downloads

Publiceret

1998-01-10

Citation/Eksport

Pagter, J., & Rauhe, T. (1998). Optimal Time-Space Trade-Offs for Sorting. BRICS Report Series, 5(10). https://doi.org/10.7146/brics.v5i10.19282

Nummer

Nr. 10 (1998): RS-10 Optimal Time-Space Trade-Offs for Sorting

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).