Skip to main content
Conference Proceedings

Best increments for the average case of shellsort

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2138 106-117
DOI: 10.1007/3-540-44669-9_12
8Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousand elements. The obtained sequences outperform by about 3% the best ones known so far, and there is a plausible evidence that they are the optimal ones.

Cite

CITATION STYLE

APA

Ciura, M. (2001). Best increments for the average case of shellsort. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2138, pp. 106–117). Springer Verlag. https://doi.org/10.1007/3-540-44669-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free