Skip to search formSkip to main contentSkip to account menu

Shellsort

Known as: Shell Sort, Shell, Shell's method 
Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be seen as either a generalization of sorting by… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Algorithm performance coverage in textbooks emphasizes patterns of growth in execution times, relative to the size of the problem… 
2009
2009
An improved collision detection algorithm based on AABB is presented. During the global search, each axis is cut into a series of… 
2007
2007
— Many algorithms are available for sorting the unordered elements. Most important of them are Bubble sort, Heap sort, Insertion… 
1999
1999
The recent popularity of genetic algorithms (GA's) and their application to a wide variety of problems is a result of their ease… 
1997
1997
We show lower bounds on the worst-case complexity of Shellsort. In particular, we give a fairly simple proof of an ?(n(lg2n… 
1996
1996
A perturbation technique can be used to simplify and sharpen A. C. Yao's theorems about the behavior of shellsort with increments… 
1992
1992
The authors give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained… 
1987
1987
Shellsort is a simple classic algorithm that runs competitively on both midsized and nearly sorted files. It uses a increment… 
Review
1985
Review
1985
?his paper is intended both as a. tutorial paper and a partial review of advanced mathematical methods in the average case…