The Quicksort Process
classification
🧮 math.PR
keywords
processquicksortcadlagconvergescorrectlyduringfunctionsincreasing
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.