The worst-case complexity of any version of Shellsort is of higher order: Plaxton, Poonen, and Suel showed that it grows at least as rapidly as Ω(N(logN/log logN)2).
D.L. Shell made substantial improvements to the algorithm; the modified version is called Shell sort.