On Shellsort and the frobenius problem
Part I Computer Science
- Cite this article as:
- Selmer, E.S. BIT (1989) 29: 37. doi:10.1007/BF01932703
- 47 Downloads
A boundO(N1+1/k) for the running time of Shellsort, withO(logN) passes, is proved very simply by application of a Frobenius basis withk elements.
CR categoriesE.5 F.2.2 G.2
© BIT Foundations 1989