About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Lower bound on the size of shellsort sorting networks
Abstract
Shellsort is a sorting algorithm that is based on a set of parameters called increments. Shellsort has been used both as a sequential sorting algorithms and as a sorting network. The central result of this paper is that all Shellsort sorting networks based on monotonically decreasing increments require Ω(N log2N/log log N) comparators. Previously, only the trivial Ω(N log N) bound was known for this class of networks. The lower bound obtained in this paper nearly matches the upper bound of O(N log2 N) that was proven by Pratt.