The Quicksort process

Mahmoud Ragab and Uwe Roesler

Stochastic Processes and their Applications, 2014, vol. 124, issue 2, 1036-1054

Abstract: Quicksort on the fly returns the input of n reals in increasing natural order during the sorting process. Correctly normalized the running time up to returning the l-th smallest out of n seen as a process in l converges weakly to a limiting process with path in the space of cadlag functions.

Keywords: Sorting; Quicksort; Divide and conquer algorithm; Random algorithm; Running time analysis; Stochastic process; Cadlag functions; Asymptotics; Skorodhod metric (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304414913002512
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:124:y:2014:i:2:p:1036-1054

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spa.2013.09.014

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().