IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v130y2020i9p5290-5309.html
   My bibliography  Save this article

Almost sure convergence to the Quicksort process

Author

Listed:
  • Roesler, Uwe

Abstract

The algorithm Partial Quicksort, introduced by Conrado Martínez, sorts the l smallest real numbers for a set of n different ones. It uses a splitting like Quicksort, continuing always with the leftmost list. The normalized running time Yn(t) converges with ln→t in distribution to a non degenerate limit. The finite dimensional distributions of the process Yn converge to a limit (Ragab and Roesler (2014)), called the Quicksort process. In this paper we will present the algorithm Quicksort on the fly, a version of Partial Quicksort, showing the almost sure convergence of Yn to the Quicksort process in Skorokhod metric.

Suggested Citation

  • Roesler, Uwe, 2020. "Almost sure convergence to the Quicksort process," Stochastic Processes and their Applications, Elsevier, vol. 130(9), pages 5290-5309.
    • Handle: RePEc:eee:spapps:v:130:y:2020:i:9:p:5290-5309
    DOI: 10.1016/j.spa.2020.03.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414920301629
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spa.2020.03.008?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ragab, Mahmoud & Roesler, Uwe, 2014. "The Quicksort process," Stochastic Processes and their Applications, Elsevier, vol. 124(2), pages 1036-1054.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Leckey, Kevin & Neininger, Ralph & Sulzbach, Henning, 2019. "Process convergence for the complexity of Radix Selection on Markov sources," Stochastic Processes and their Applications, Elsevier, vol. 129(2), pages 507-538.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:130:y:2020:i:9:p:5290-5309. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.