TIGHT LOWER BOUNDS FOR SHELLSORT

被引：4

作者：

WEISS, MA

SEDGEWICK, R

机构：

[1] FLORIDA INT UNIV,SCH COMP SCI,MIAMI,FL 33199

[2] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544

来源：

JOURNAL OF ALGORITHMS | 1990年 / 11卷 / 02期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1016/0196-6774(90)90005-Y

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

It is proved that the running time of Shellsort using an increment sequence given by Sedgewick is Ω(N 4 3) which matches the known upper bound. Extending this proof technique to various increment sequences leads to lower bounds that in general always match the known upper bounds. This suggests that Shellsort runs in ω (N1+ε{lunate}/ log N for increment sequences of practical interest and that no increment sequence exists that would make Shellsort optimal. © 1990.

引用

页码：242 / 251

页数：10

共 50 条

[41] Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
Cao, Yixin
Sandeep, R. B.
[J]. PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 875 - 880
[42] Tight upper and lower bounds for the reciprocal sum of Proth primes
Bertalan Borsos
Attila Kovács
Norbert Tihanyi
[J]. The Ramanujan Journal, 2022, 59 : 181 - 198
[43] Tight lower bounds on the time it takes to generate a geometric phase
Hornedal, Niklas
Sonnerborn, Ole
[J]. PHYSICA SCRIPTA, 2023, 98 (10)
[44] TIGHT LOWER BOUNDS FOR PROBABILISTIC SOLITUDE VERIFICATION ON ANONYMOUS RINGS
ABRAHAMSON, K
ADLER, A
HIGHAM, L
KIRKPATRICK, D
[J]. JOURNAL OF THE ACM, 1994, 41 (02) : 277 - 310
[45] Tight lower bounds on the size of a maximum matching in a regular graph
Henning, Michael A.
Yeo, Anders
[J]. GRAPHS AND COMBINATORICS, 2007, 23 (06) : 647 - 657
[46] Tight lower bounds for st-connectivity on the NNJAG model
Edmonds, J
Poon, CK
Achlioptas, D
[J]. SIAM JOURNAL ON COMPUTING, 1999, 28 (06) : 2257 - 2284
[47] Tight lower bounds on broadcast function for n=24 and 25
Barsky, Georgy
Grigoryan, Hayk
Harutyunyan, Hovhannes. A.
[J]. DISCRETE APPLIED MATHEMATICS, 2014, 175 : 109 - 114
[48] Tight upper and lower bounds for the reciprocal sum of Proth primes
Borsos, Bertalan
Kovacs, Attila
Tihanyi, Norbert
[J]. RAMANUJAN JOURNAL, 2022, 59 (01): : 181 - 198
[49] Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Lech Duraj
Marvin Künnemann
Adam Polak
[J]. Algorithmica, 2019, 81 : 3968 - 3992
[50] Arbitrarily tight upper and lower bounds on the Bayesian probability of error
AviItzhak, H
Diep, T
[J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1996, 18 (01) : 89 - 91

← 1 2 3 4 5 →