An empirical study of the gap sequences for Shell sort
Articles
Irmantas Radavičius
Vilnius University
Mykolas Baranauskas
Vilnius University
Published 2013-12-15
https://doi.org/10.15388/LMR.A.2013.14
PDF

Keywords

sorting algorithm
Shell sort
gap sequence

How to Cite

Radavičius I. and Baranauskas M. (2013) “An empirical study of the gap sequences for Shell sort”, Lietuvos matematikos rinkinys, 54(A), pp. 61–66. doi: 10.15388/LMR.A.2013.14.

Abstract

We present an improved version of the Shell sort algorithm. Using the algorithm, we study various geometrical sequences and the performance of Shell sort. We demonstrate that neither number of assignments nor the number of comparisons is sufficient to properly evaluate Shell sort and pick the optimal gap sequence. We argue that one should count both operations, as well as measure actual running times.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy