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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics and theoretical computer science Jg. DMTCS Proceedings vol. AQ,...; H. Proceedings; S. 339 - 348
Hauptverfasser: Bindjeme, Patrick, fill, james Allen
Format: Journal Article Tagungsbericht
Sprache:Englisch
Veröffentlicht: DMTCS 01.01.2012
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Schriftenreihe:DMTCS Proceedings
Schlagworte:
ISSN:1365-8050, 1462-7264, 1365-8050
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
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 the $d_2$-distance is of order between $n^{-1} \log{n}$ and $n^{-1/2}$, and another by Neininger and Ruschendorf (2002) found that the Zolotarev $\zeta _3$-distance is of exact order $n^{-1} \log{n}$. Our expression reveals that the $L^2$-distance is asymptotically equivalent to $(2 n^{-1} \ln{n})^{1/2}$.
AbstractList 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 the $d_2$-distance is of order between $n^{-1} \log{n}$ and $n^{-1/2}$, and another by Neininger and Ruschendorf (2002) found that the Zolotarev $\zeta _3$-distance is of exact order $n^{-1} \log{n}$. Our expression reveals that the $L^2$-distance is asymptotically equivalent to $(2 n^{-1} \ln{n})^{1/2}$.
Author Bindjeme, Patrick
fill, james Allen
Author_xml – sequence: 1
  givenname: Patrick
  surname: Bindjeme
  fullname: Bindjeme, Patrick
  organization: Department of Applied Mathematics and Statistics [Baltimore]
– sequence: 2
  givenname: james Allen
  surname: fill
  fullname: fill, james Allen
BackLink https://inria.hal.science/hal-01197222$$DView record in HAL
BookMark eNptkVtLJDEQhYMo6Iw-7R_Igw_K0m4ufUkeh3FWZRtE1FdDdS6acbojSXZx_r3tzC7o4lMVxTlfVXEmaHcIg0XoGyVnZc2k-GH6rNMZJ4TvoAPK66oQpCK7H_p9NElpSQhlsmwO0P3iFXTGx-0DOy7OfcowaItdDD3OTxa3vvcZuxDxzW-vn29DzPiXXeN56F8g-hSGhE8Wr9kOxho861KOI-70EO05WCV79LdO0f3Pxd38smivL67ms7bQjFa8MJXtmCu1JEJaoW1XEwG0KSWpZcM6YWqwDacNg1JUpePUVEKDA0e41JYbPkVXW64JsFQv0fcQ1yqAV5tBiI8KYvZ6ZVXNgbmqM9IIUVpCQFacW9awmnfUCD6yTresJ1h9Ql3OWvU-I5SOVzH2h45autXqGFKK1intM2QfhvF_v1KUqE0eapOHes9j9Hz_z_NvyVfqNwg2jL8
CitedBy_id crossref_primary_10_1002_rsa_20674
crossref_primary_10_1002_rsa_20659
crossref_primary_10_1016_j_future_2017_01_034
crossref_primary_10_1007_s00605_021_01533_9
ContentType Journal Article
Conference Proceeding
Copyright Attribution
Copyright_xml – notice: Attribution
DBID AAYXX
CITATION
1XC
VOOES
DOA
DOI 10.46298/dmtcs.3003
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef

Database_xml – sequence: 1
  dbid: DOA
  name: Open Access资源_DOAJ
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1365-8050
EndPage 348
ExternalDocumentID oai_doaj_org_article_63a2f5bd9d884e00a9533e27263b1d83
oai:HAL:hal-01197222v1
10_46298_dmtcs_3003
GroupedDBID -~9
.4S
.DC
29G
2WC
5GY
5VS
8FE
8FG
AAFWJ
AAYXX
ABDBF
ABJCF
ABUWG
ACGFO
ACIWK
ACUHS
ADBBV
ADQAK
AENEX
AFFHD
AFKRA
AFPKN
AIAGR
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARCSS
B0M
BCNDV
BENPR
BFMQW
BGLVJ
BPHCQ
C1A
CCPQU
CITATION
EAP
EBS
ECS
EDO
EJD
EMK
EPL
EST
ESX
GROUPED_DOAJ
HCIFZ
I-F
IAO
IBB
ICD
ITC
J9A
KQ8
KWQ
L6V
M7S
MK~
ML~
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
REM
RNS
RSU
TR2
TUS
XSB
~8M
1XC
VOOES
ID FETCH-LOGICAL-c2153-d5eb2f4c9089e8ceb608a174906972b8d6ae73172a4854f31d58cafaf039ce3d3
IEDL.DBID DOA
ISSN 1365-8050
1462-7264
IngestDate Mon Nov 10 04:33:51 EST 2025
Sat Nov 29 15:00:35 EST 2025
Sat Nov 29 02:48:24 EST 2025
Tue Nov 18 22:08:47 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue Proceedings
Keywords limit distribution
key comparisons
QuickSort
L^2$-distance
Language English
License https://creativecommons.org/licenses/by/4.0
Attribution: http://creativecommons.org/licenses/by
LinkModel DirectLink
MeetingName 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12)
MergedId FETCHMERGED-LOGICAL-c2153-d5eb2f4c9089e8ceb608a174906972b8d6ae73172a4854f31d58cafaf039ce3d3
OpenAccessLink https://doaj.org/article/63a2f5bd9d884e00a9533e27263b1d83
PageCount 10
ParticipantIDs doaj_primary_oai_doaj_org_article_63a2f5bd9d884e00a9533e27263b1d83
hal_primary_oai_HAL_hal_01197222v1
crossref_citationtrail_10_46298_dmtcs_3003
crossref_primary_10_46298_dmtcs_3003
PublicationCentury 2000
PublicationDate 2012-01-01
PublicationDateYYYYMMDD 2012-01-01
PublicationDate_xml – month: 01
  year: 2012
  text: 2012-01-01
  day: 01
PublicationDecade 2010
PublicationSeriesTitle DMTCS Proceedings
PublicationTitle Discrete mathematics and theoretical computer science
PublicationYear 2012
Publisher DMTCS
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Publisher_xml – name: Discrete Mathematics and Theoretical Computer Science
– name: DMTCS
– name: Discrete Mathematics & Theoretical Computer Science
SSID ssj0012947
ssib044734695
Score 1.8251611
Snippet 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...
SourceID doaj
hal
crossref
SourceType Open Website
Open Access Repository
Enrichment Source
Index Database
StartPage 339
SubjectTerms [info.info-cg] computer science [cs]/computational geometry [cs.cg]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
[math.math-co] mathematics [math]/combinatorics [math.co]
Combinatorics
Computational Geometry
Computer Science
Data Structures and Algorithms
Discrete Mathematics
key comparisons
l^2$-distance
limit distribution
Mathematics
quicksort
Title Exact $L^2$-Distance from the Limit for QuickSort Key Comparisons (Extended Abstract)
URI https://inria.hal.science/hal-01197222
https://doaj.org/article/63a2f5bd9d884e00a9533e27263b1d83
Volume DMTCS Proceedings vol. AQ,...
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: Open Access资源_DOAJ
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: DOA
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044734695
  issn: 1365-8050
  databaseCode: M~E
  dateStart: 19980101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Continental Europe Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BFMQW
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/conteurope
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: M7S
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest - Publicly Available Content Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: PIMPY
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS9xAFH6IemgPtdqWrloZyh5qIXUyM0lmjltdsdSVFRX0YphfoVJdxY3SXvzb-2aSLApCL15yGB5JeC_hfe_NvO8D6FfU-gBrE6YcTUTqdSK50AmzRpmc-sobGcUmioMDeXqqxo-kvsKZsIYeuHHcVs41qzLjlJNSeEp1OA_pWcFyblInI88nop6umGr3D5gSRTONJ3Km5Ja7qu30G6edNlabfyJNP2aVX10XNWaV3bfwpoWDZNC8xjLM-ckKLHVSC6T981bg9WhGrzp9ByfDP9rWpL9_zvrJTkCAaETCpAhBKxKHlgiiUXJ4d2F_HyHCJj_9X7I90xycki_DtvtNBiZ0O2y9-R5OdofH23tJq4-QWEzUPHEZlsWVsGHrzkvr0bdSY4WhaK4KZqTLtS8QHzAtZCYqnrpMWl3pinJlPXf8A8xPrif-I5CMe0Mrhxkt5QJBjS6sQfCRWZNJY3Tag6-d10rbkocHDYvLEouI6OIyurgMLu5Bf2Z803BmPG_2Pbh_ZhKIruMChr9sw1_-L_w9-IzBe3KPvcF-GdYaSTXG7tPVl3jSGrxCsMSa9ss6zNe3d_4TLNr7-mJ6uxE_P7yOHoYbsDD-MRqf_QMibOEg
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Discrete+mathematics+and+theoretical+computer+science&rft.atitle=Exact+%24L%5E2%24-Distance+from+the+Limit+for+QuickSort+Key+Comparisons+%28Extended+Abstract%29&rft.au=Bindjeme%2C+Patrick&rft.au=Fill%2C+James+Allen&rft.series=DMTCS+Proceedings&rft.date=2012-01-01&rft.pub=DMTCS&rft.issn=1462-7264&rft.eissn=1365-8050&rft.volume=DMTCS+Proceedings+vol.+AQ%2C+23rd+Intern.+Meeting+on+Probabilistic%2C+Combinatorial%2C+and+Asymptotic+Methods+for+the+Analysis+of+Algorithms+%28AofA%2712%29&rft.spage=339&rft.epage=348&rft_id=info:doi/10.46298%2Fdmtcs.3003&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-01197222v1
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon