Open AccessUm Limite Superior para a Complexidade do ShellSort
Author(s) -
Raquel M. Souza,
Fabiano S. Oliveira,
Paulo E. D. Pinto
Publication year - 2018
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5753/etc.2018.3144
Subject(s) - sequence (biology) , computational complexity theory , time complexity , computer science , algorithm , mathematics , theoretical computer science , biology , genetics
The worst-case time complexity of the ShellSort algorithm is known only for some specific sequences (a sequence is a parameter of the algorithm). Relating the algorithm to the Frobenius number concept, we present an algorithm for determining the maximum number of comparisons for any sequence and array to be ordered. We apply this method together with the empirical determination of complexity to analyze several sequences whose worst case complexity are known. We show that the empirical approach succeeded in determining the same complexities which are analytically known and presented its results for sequences with unknown worst-case time complexity.