On the average‐case complexity of Shellsort

We prove a lower bound expressed in the increment sequence on the average‐case complexity of the number of inversions of Shellsort. This lower bound is sharp in every case where it could be checked. A special case of this lower bound yields the general Jiang‐Li‐Vitányi lower bound. We obtain new res...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Random structures & algorithms Jg. 52; H. 2; S. 354 - 363
1. Verfasser: Vitanyi, Paul
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Hoboken Wiley Subscription Services, Inc 01.03.2018
Schlagworte:
average‐case complexity
Complexity
Inversions
Kolmogorov complexity
lower bound
Lower bounds
Shellsort
ISSN:1042-9832, 1098-2418
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We prove a lower bound expressed in the increment sequence on the average‐case complexity of the number of inversions of Shellsort. This lower bound is sharp in every case where it could be checked. A special case of this lower bound yields the general Jiang‐Li‐Vitányi lower bound. We obtain new results, for example, determining the average‐case complexity precisely in the Yao‐Janson‐Knuth 3‐pass case.
AbstractList We prove a lower bound expressed in the increment sequence on the average‐case complexity of the number of inversions of Shellsort. This lower bound is sharp in every case where it could be checked. A special case of this lower bound yields the general Jiang‐Li‐Vitányi lower bound. We obtain new results, for example, determining the average‐case complexity precisely in the Yao‐Janson‐Knuth 3‐pass case.
Author Vitányi, Paul
Author_xml – sequence: 1
  givenname: Paul
  surname: Vitanyi
  fullname: Vitanyi, Paul
BookMark eNp10L9OwzAQBnALFYm2MPAGkZgY0p7tuLmMVcU_qVIlCrPlODZtlcbBToFsPALPyJOQElam-4bf3UnfiAwqVxlCLilMKACb-qAmDFKenpAhhQxjllAcHHPC4gw5OyOjEHYAnWF8SOJVFTUbE6k349WL-f780iqYSLt9XZqPbdNGzkbrjSnL4HxzTk6tKoO5-Jtj8nx787S4j5eru4fFfBlrlrE0ngmacaCJQNCpzTlTiciLokgVBbQ4A8aVQpVgkQrVJW4FcpGzgoOmFjQfk6v-bu3d68GERu7cwVfdS0kzRKQCM9qp615p70Lwxsrab_fKt5KCPLYhuzbkbxudnfb2fVua9n8oH9fzfuMHfddhtw
Cites_doi 10.1002/(SICI)1098-2418(199701/03)10:1/2<125::AID-RSA6>3.0.CO;2-X
10.1145/366552.366557
10.1007/978-0-387-49820-1
10.1093/comjnl/34.1.88
10.1145/355483.355488
10.1016/0022-0000(85)90042-X
10.1145/368370.368387
10.1006/jagm.1993.1032
10.1016/0196-6774(80)90003-6
ContentType Journal Article
Copyright 2017 Wiley Periodicals, Inc.
2018 Wiley Periodicals, Inc.
Copyright_xml – notice: 2017 Wiley Periodicals, Inc.
– notice: 2018 Wiley Periodicals, Inc.
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1002/rsa.20737
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1098-2418
EndPage 363
ExternalDocumentID 10_1002_rsa_20737
RSA20737
Genre article
GroupedDBID -~X
.3N
.4S
.DC
.GA
.Y3
05W
0R~
10A
123
1L6
1OB
1OC
1ZS
31~
33P
3SF
3WU
4.4
4ZD
50Y
50Z
51W
51X
52M
52N
52O
52P
52S
52T
52U
52W
52X
5VS
66C
702
7PT
8-0
8-1
8-3
8-4
8-5
8UM
930
A03
AAESR
AAEVG
AAHHS
AAHQN
AAMNL
AANHP
AANLZ
AAONW
AASGY
AAXRX
AAYCA
AAZKR
ABCQN
ABCUV
ABEML
ABIJN
ABJNI
ABPVW
ACAHQ
ACBWZ
ACCFJ
ACCZN
ACGFO
ACGFS
ACIWK
ACPOU
ACRPL
ACSCC
ACXBN
ACXQS
ACYXJ
ADBBV
ADEOM
ADIZJ
ADKYN
ADMGS
ADNMO
ADOZA
ADXAS
ADZMN
AEEZP
AEIGN
AEIMD
AENEX
AEQDE
AEUQT
AEUYR
AFBPY
AFFPM
AFGKR
AFPWT
AFWVQ
AFZJQ
AHBTC
AIAGR
AITYG
AIURR
AIWBW
AJBDE
AJXKR
ALAGY
ALMA_UNASSIGNED_HOLDINGS
ALUQN
ALVPJ
AMBMR
AMYDB
ARCSS
ASPBG
ATUGU
AUFTA
AVWKF
AZBYB
AZFZN
AZVAB
BAFTC
BDRZF
BFHJK
BHBCM
BMNLL
BMXJE
BNHUX
BROTX
BRXPI
BY8
CS3
D-E
D-F
DCZOG
DPXWK
DR2
DRFUL
DRSTM
DU5
EBS
EJD
F00
F01
F04
FEDTE
FSPIC
G-S
G.N
GNP
GODZA
H.T
H.X
HBH
HF~
HGLYW
HHY
HVGLF
HZ~
H~9
IX1
J0M
JPC
KQQ
LATKE
LAW
LC2
LC3
LEEKS
LH4
LITHE
LOXES
LP6
LP7
LUTES
LW6
LYRES
M6L
MEWTI
MK4
MRFUL
MRSTM
MSFUL
MSSTM
MXFUL
MXSTM
N04
N05
N9A
NF~
NNB
O66
O9-
OIG
P2P
P2W
P2X
P4D
PALCI
PQQKQ
Q.N
Q11
QB0
QRW
R.K
RIWAO
RJQFR
ROL
RWI
RX1
SAMSI
SUPJJ
TN5
TUS
UB1
V2E
V8K
W8V
W99
WBKPD
WH7
WIB
WIH
WIK
WOHZO
WQJ
WRC
WWM
WXSBR
WYISQ
XBAML
XG1
XPP
XSW
XV2
ZZTAW
~IA
~WT
AAMMB
AAYXX
AEFGJ
AEYWJ
AGHNM
AGQPQ
AGXDD
AGYGG
AIDQK
AIDYY
AIQQE
AMVHM
CITATION
O8X
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c2927-65193014580c7fb32a45bddd7a108f86023aa8a48d75aaa83f5835b2d30c1f0c3
IEDL.DBID DRFUL
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000424391700007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1042-9832
IngestDate Fri Jul 25 12:18:21 EDT 2025
Sat Nov 29 02:48:12 EST 2025
Wed Jan 22 16:42:19 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
License http://onlinelibrary.wiley.com/termsAndConditions#vor
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2927-65193014580c7fb32a45bddd7a108f86023aa8a48d75aaa83f5835b2d30c1f0c3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/rsa.20737
PQID 1988815891
PQPubID 1016429
PageCount 10
ParticipantIDs proquest_journals_1988815891
crossref_primary_10_1002_rsa_20737
wiley_primary_10_1002_rsa_20737_RSA20737
PublicationCentury 2000
PublicationDate March 2018
2018-03-00
20180301
PublicationDateYYYYMMDD 2018-03-01
PublicationDate_xml – month: 03
  year: 2018
  text: March 2018
PublicationDecade 2010
PublicationPlace Hoboken
PublicationPlace_xml – name: Hoboken
PublicationTitle Random structures & algorithms
PublicationYear 2018
Publisher Wiley Subscription Services, Inc
Publisher_xml – name: Wiley Subscription Services, Inc
References 1965; 3
1993; 15
1965; 1
2000; 47
1991; 34
1997; 10
1963; 6
1980; 1
2008
1973
1972
1985; 31
1959; 2
Pratt V. R. (e_1_2_6_11_1) 1972
e_1_2_6_10_1
Kolmogorov A. N. (e_1_2_6_7_1) 1965; 1
Knuth D. E. (e_1_2_6_6_1) 1973
e_1_2_6_8_1
e_1_2_6_5_1
e_1_2_6_4_1
e_1_2_6_13_1
e_1_2_6_14_1
e_1_2_6_3_1
e_1_2_6_2_1
e_1_2_6_12_1
e_1_2_6_15_1
Papernov A. (e_1_2_6_9_1) 1965; 3
References_xml – volume: 1
  start-page: 1
  year: 1965
  end-page: 7
  article-title: , Problems Inform
  publication-title: Transmission
– volume: 15
  start-page: 101
  year: 1993
  end-page: 124
  article-title: The worst case in Shellsort and related algorithms
  publication-title: J. Algorithms
– volume: 3
  start-page: 63
  year: 1965
  end-page: 75
  article-title: , Probl. Inform
  publication-title: Transm.
– volume: 10
  start-page: 125
  year: 1997
  end-page: 142
  article-title: Shellsort with three increments
  publication-title: Random Struct. Algorithms
– volume: 1
  start-page: 14
  year: 1980
  end-page: 50
  article-title: An analysis of ‐Shellsort
  publication-title: J. Algorithms
– year: 1972
  publication-title: , Shellsort and sorting networks
– volume: 6
  start-page: 206
  issue: 5
  year: 1963
  end-page: 213
  article-title: An empirical study of minimal storage sorting
  publication-title: Commun. ACM
– year: 2008
– volume: 34
  start-page: 88
  year: 1991
  end-page: 91
  article-title: Empirical study of the expected running time of Shellsort
  publication-title: Comput. J.
– volume: 2
  start-page: 30
  issue: 7
  year: 1959
  end-page: 32
  article-title: A high‐speed sorting procedure
  publication-title: Commun. ACM
– year: 1973
– volume: 47
  start-page: 905
  issue: 5
  year: 2000
  end-page: 911
  article-title: A lower bound on the average‐case complexity of Shellsort
  publication-title: J. Assoc. Comput. Mach.
– volume: 31
  start-page: 210
  year: 1985
  end-page: 224
  article-title: Improved upper bounds on Shellsort
  publication-title: J. Comput. Syst. Sci.
– ident: e_1_2_6_4_1
  doi: 10.1002/(SICI)1098-2418(199701/03)10:1/2<125::AID-RSA6>3.0.CO;2-X
– volume-title: The Art of Computer Programming, Vol.3: Sorting and Searching
  year: 1973
  ident: e_1_2_6_6_1
– ident: e_1_2_6_2_1
  doi: 10.1145/366552.366557
– ident: e_1_2_6_8_1
  doi: 10.1007/978-0-387-49820-1
– ident: e_1_2_6_13_1
– ident: e_1_2_6_14_1
  doi: 10.1093/comjnl/34.1.88
– ident: e_1_2_6_5_1
  doi: 10.1145/355483.355488
– ident: e_1_2_6_3_1
  doi: 10.1016/0022-0000(85)90042-X
– volume: 3
  start-page: 63
  year: 1965
  ident: e_1_2_6_9_1
  article-title: A method for information sorting in computer memories, Probl. Inform
  publication-title: Transm.
– ident: e_1_2_6_12_1
  doi: 10.1145/368370.368387
– ident: e_1_2_6_10_1
  doi: 10.1006/jagm.1993.1032
– year: 1972
  ident: e_1_2_6_11_1
  publication-title: , Shellsort and sorting networks
– volume: 1
  start-page: 1
  year: 1965
  ident: e_1_2_6_7_1
  article-title: Three approaches to the quantitative definition of information, Problems Inform
  publication-title: Transmission
– ident: e_1_2_6_15_1
  doi: 10.1016/0196-6774(80)90003-6
SSID ssj0007323
Score 2.1475165
Snippet We prove a lower bound expressed in the increment sequence on the average‐case complexity of the number of inversions of Shellsort. This lower bound is sharp...
We prove a lower bound expressed in the increment sequence on the average-case complexity of the number of inversions of Shellsort. This lower bound is sharp...
SourceID proquest
crossref
wiley
SourceType Aggregation Database
Index Database
Publisher
StartPage 354
SubjectTerms average‐case complexity
Complexity
Inversions
Kolmogorov complexity
lower bound
Lower bounds
Shellsort
Title On the average‐case complexity of Shellsort
URI https://onlinelibrary.wiley.com/doi/abs/10.1002%2Frsa.20737
https://www.proquest.com/docview/1988815891
Volume 52
WOSCitedRecordID wos000424391700007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVWIB
  databaseName: Wiley Online Library Full Collection 2020
  customDbUrl:
  eissn: 1098-2418
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007323
  issn: 1042-9832
  databaseCode: DRFUL
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV09T8MwED2VlgEGvhGFgiLEwGLVcZzaEVMFVAxQUEulbpHt2BJLipqCGPkJ_EZ-CXa-CgMSEpstJZF9enf3nFzeAZzR0A8EVgkSlNgDClcSCSIjpJMI25jMVM_QvNkEGw75dBo9NOCi-hem0IeoX7g5z8jjtXNwIbPuUjR0njnZIBawFWgRi1vahNbVaDC5rQMxC0hRX08JiixyK2EhTLr1zT_T0ZJjfmeqeaoZbP5rkVuwUTJMr19AYhsaOt2B9btanjXbBXSfenbqCYtjG08-3z-UTWZeXl6u3ywv92bGG7sS0cyy8z2YDK4fL29Q2TcBKRIRhnqOlbnPhRwrZmRABA1lkiRM-Jgb13QqEIILyhMWCjsKTGh5mCRJgJVvsAr2oZnOUn0AnhKaRJITqYWk2lhvZ1RpyiPfcO1j3YbTynzxcyGPERdCyCS2e4_zvbehUxk2Lj0ki_3Inr1919OwDee5CX9_QDwa9_PB4d8vPYI1y214US7WgeZi_qKPYVW9Lp6y-UkJlS8aQsHa
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB5qK6gH32K1ahAPXkKT3U13F7wUtVRsq_QBvYXNZgNeUmmqePQn-Bv9Je7mVT0IgrcNJCE7fDPz7e7kG4AL4rlYODK0BUF6gcJkYAsUcFuF3NExmcpWRNJmE3QwYNMpf6zAVfEvTKYPUW64Gc9I47VxcLMh3Vyqhs4ToxtEMV2BGtEw8qpQuxl2Jr0yElOMsgJ7gmyuoVsoCzmoWT78Mx8tSeZ3qprmms7W_75yGzZzjmm1M1DsQEXFu7DRLwVakz2wH2JLX1pCI1lHlM_3D6nTmZUWmKs3zcytWWSNTJFoovn5Pkw6t-Prrp13TrAl4ojaLcPLzIEhcySNAowE8YIwDKlwHRaZtlNYCCYIC6kn9AhHnmZiAQqxI93IkfgAqvEsVodgSaEQDxgKlAiIirS_UyIVYdyNmHIdVYfzwn7-cyaQ4WdSyMjXc_fTudehUVjWz30k8V2uV9-u6WpYh8vUhr-_wB-O2ung6O-3nsFad9zv-b27wf0xrGumw7LisQZUF_MXdQKr8nXxlMxPc9x8AcN-xco
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH7MTUQP_hanU4t48FKWpumSgJfhHIpzjs3BbiVNE_DSjXWKR_8E_0b_EtOf04MgeEugLcnjfe99aV-_B3BBPMcVSIa2INgcUJgMbIEDbquQIxOTqWxpkjaboP0-m0z4oAJXxb8wmT5E-cItQUYarxOAq1mom0vV0Hmc6AZRl65AjXi8ZWBZ6wy7414ZiamLswJ7gm1uXLdQFkK4Wd78Mx8tSeZ3qprmmu7W_1a5DZs5x7TamVPsQEVFu7DxUAq0xntgP0aWmVrCeLKJKJ_vH9KkMystMFdvhplbU22NkiLR2PDzfRh3b56ub-28c4ItMcfUbiW8LPlgyJCkOnCxIF4QhiEVDmI6aTvlCsEEYSH1hBm52jNMLMChi6SjkXQPoBpNI3UIlhQK84DhQImAKG3wTolUhHFHM-UgVYfzwn7-LBPI8DMpZOybvfvp3uvQKCzr5xiJfYeb07eTdDWsw2Vqw98f4A9H7XRw9PdLz2Bt0On6vbv-_TGsG6LDstqxBlQX8xd1AqvydfEcz09zt_kCpIjFRQ
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=article&rft.atitle=On+the+average%E2%80%90case+complexity+of+Shellsort&rft.jtitle=Random+structures+%26+algorithms&rft.au=Vit%C3%A1nyi%2C+Paul&rft.date=2018-03-01&rft.issn=1042-9832&rft.eissn=1098-2418&rft.volume=52&rft.issue=2&rft.spage=354&rft.epage=363&rft_id=info:doi/10.1002%2Frsa.20737&rft.externalDBID=n%2Fa&rft.externalDocID=10_1002_rsa_20737
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1042-9832&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1042-9832&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1042-9832&client=summon