Uma Nova Proposta para a Obtenção da Complexidade de Pior Caso do ShellSort
Abstract
Keywords
Full Text:
PDF (Português (Brasil))References
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms. Editora MIT, 2009.
D. L. Shell, “A high-speed sorting procedure,” Communications of the ACM, vol. 2, no. 7, pp. 30–32, 1959.
R. M. Frank and R. B. Lazarus, “A high-speed sorting procedure,” Communications of the ACM, vol. 3, no. 1, pp. 20–22, 1960.
V. R. Pratt, Shellsort and sorting networks. PhD thesis, Universidade de Stanford, 1972.
R. Sedgewick, “A new upper bound for shellsort,” Journal of Algorithms, vol. 7, no. 2, pp. 159–173, 1986.
G. H. Gonnet and R. A. Baeza-Yates, Handbook of Algorithms and Data Structures: in Pascal and C. EUA: Addison-Wesley, 1991.
M. Ciura, “Best increments for the average case of shellsort,” in Fundamentals of Computation Theory, pp. 106–117, Springer, 2001.
M. T. Goodrich, “Randomized shellsort: A simple data-oblivious sorting algorithm,” Journal of the ACM (JACM), vol. 58, no. 6, p. 27, 2011.
P. Vitányi, “On the average-case complexity of shellsort,” Random Structures & Algorithms, vol. 52, no. 2, pp. 354–363, 2018.
R. M. Souza, F. S. Oliveira and P. E. D. Pinto, "Um Limite Superior para a Complexidade do ShellSort", Anais do III Encontro de Teoria da Computação, pp. 49–52, 2018, SBC.
R. M. Souza, F. S. Oliveira and P. E. D. Pinto, "O Algoritmo ShellSort e o Número de Frobenius", XXXVIII Congresso Nacional de Matemática Aplicada e Computacional, 2018, SBMAC.
T. N. Hibbard, “An empirical study of minimal storage sorting,” Communications of the ACM, vol. 6, no. 5, pp. 206–213, 1963.
A. A. Papernov and G. V. Stasevich, “A method of information sorting in computer memories,” Problemy Peredachi Informatsii, vol. 1, no. 3, pp. 81–98, 1965.
D. E. Knuth, The Art of Computer Programming 3: Sorting and Searching. EUA: Addison-Wesley, 1998.
J. Incerpi and R. Sedgewick, “Improved upper bounds on shellsort,” in Anais do 24o Annual Symposium on Foundations of Computer Science, 1983, pp. 48–55, IEEE, 1983.
N. Tokuda, “An improved shellsort,” Anais do 12o IFIP World Computer Congress on Algorithms, Software, Architecture-Information Processing, vol. 1, pp. 449–457, 1992.
R. Cypher, “A lower bound on the size of shellsort sorting networks,” SIAM Journal on Computing, vol. 22, no. 1, pp. 62–71, 1993.
F. S. Oliveira, "EMA - WebPage", http://fabianooliveira.ime.uerj.br/ema, 2016. [Última vez acessado: 10 de Dezembro de 2018]
B. Poonen, “The worst case in shellsort and related algorithms,” Journal of Algorithms, vol. 15, no. 1, pp. 101–124, 1993.
J. L. R. Alfonsín, The diophantine Frobenius problem, vol. 30. Oxford University Press on Demand, 2005.
M. A. Weiss and R. Sedgewick, “More on shellsort increment sequences,” Information Processing Letters, vol. 34, no. 5, pp. 267–270, 1990.
DOI: https://doi.org/10.5540/tema.2019.020.03.457
Article Metrics
Metrics powered by PLOS ALM
Refbacks
- There are currently no refbacks.
Trends in Computational and Applied Mathematics
A publication of the Brazilian Society of Applied and Computational Mathematics (SBMAC)
Indexed in: