Optimal Gap Sequences in Shellsort for $n\leq16$ Elements
Combinatorics
2021-12-22 v1 Data Structures and Algorithms
Abstract
Optimal gap sequences in Shellsort, defined as gap sequences having the minimised maximum number of comparisons for a fixed number of pairwise distinct elements, are found by minimax search in reduced permutational spaces, namely Bad -sorted permutations. Exact optimal gap sequences in Shellsort for pairwise distinct elements are established, and the best known gap sequences for are listed with conjectures made. It notably discovers some optimal gap sequences consist of increments larger than the half of the total number of the elements to sort.
Cite
@article{arxiv.2112.11127,
title = {Optimal Gap Sequences in Shellsort for $n\leq16$ Elements},
author = {Ying Wai Lee},
journal= {arXiv preprint arXiv:2112.11127},
year = {2021}
}