Exact $L^2$-Distance from the Limit for QuickSort Key Comparisons (Extended Abstract)
Using a recursive approach, we obtain a simple exact expression for the $L^2$-distance from the limit in the classical limit theorem of Régnier (1989) for the number of key comparisons required by $\texttt{QuickSort}$. A previous study by Fill and Janson (2002) using a similar approach found that th...
Saved in:
| Published in: | Discrete mathematics and theoretical computer science Vol. DMTCS Proceedings vol. AQ,...; no. Proceedings; pp. 339 - 348 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article Conference Proceeding |
| Language: | English |
| Published: |
DMTCS
01.01.2012
Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science |
| Series: | DMTCS Proceedings |
| Subjects: | |
| ISSN: | 1365-8050, 1462-7264, 1365-8050 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!