Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: Extended abstract. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2007

Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: Extended abstract.

Svante Janson
  • Function : Author
  • PersonId : 830454

Abstract

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a string of 0's, and then evolves by changing each 0 to 1, with the n changes done in random order. What is the maximal number of runs of 1's? We give asymptotic results for the distribution and mean. It turns out that, as in many problems involving a maximum, the maximum is asymptotically normal, with fluctuations of order $n^{1/2}$, and to the first order well approximated by the number of runs at the instance when the expectation is maximized, in this case when half the elements have changed to 1; there is also a second order term of order $n^{1/3}$. We also treat some variations, including priority queues and sock-sorting.
Fichier principal
Vignette du fichier
dmAH0117.pdf (208.72 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184796 , version 1 (17-08-2015)

Identifiers

Cite

Svante Janson. Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: Extended abstract.. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.259-270, ⟨10.46298/dmtcs.3548⟩. ⟨hal-01184796⟩

Collections

INSMI TDS-MACS
42 View
334 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More