Sign in
Back
The Quicksort process
Journal article   Open access  Peer reviewed

The Quicksort process

Mahmoud Ragab and Uwe Roesler
Stochastic processes and their applications, Vol.124(2), pp.1036-1054
01/02/2014
DOI: https://doi.org/10.1016/j.spa.2013.09.014

Abstract

Asymptotics Cadlag functions Divide and conquer algorithm Quicksort Random algorithm Running time analysis Skorodhod metric Sorting Stochastic process
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.
url
https://doi.org/10.1016/j.spa.2013.09.014View
Published (Version of record) Open

Metrics

1 Record Views

Details