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).
Torsten Wiesel | Suel | Torsten Lilliecrona | Torsten de Winkel | Torsten Zuberbier | Torsten Suel | Torsten Rasch | Torsten May | Torsten Jansen | Torsten Fenslau |