Open AccessOn Shellsort and the frobenius problem
Author(s) -
Ernst S. Selmer
Publication year - 1989
Publication title -
bit numerical mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.904
H-Index - 59
eISSN - 1572-9125
pISSN - 0006-3835
DOI - 10.1007/bf01932703
Subject(s) - mathematics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom