Improved upper bounds on Shellsort (Q1069307): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0022-0000(85)90042-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2035580504 / rank | |||
Normal rank |
Latest revision as of 10:08, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved upper bounds on Shellsort |
scientific article |
Statements
Improved upper bounds on Shellsort (English)
0 references
1985
0 references
The running time of Shellsort, with the number of passes restricted to O(log N), was thought for some time to be \(\Theta (N^{3/2})\), due to general results of Pratt. Sedgewick recently gave an \(O(N^{4/3})\) bound, but extensions of his method to provide better bounds seem to require new results on a classical problem in number theory. In this paper, we use a different approach to achieve \(O(N^{1+\epsilon /\sqrt{lg N}})\), for any \(\epsilon >0\).
0 references
sorting
0 references
running time
0 references